%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : NUM025-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:51:39 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.38s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_less,axiom,
( less(C,B)
| ~ less(C,A)
| ~ less(A,B) ),
file('NUM001-1.ax',transitivity_of_less) ).
cnf(no_number_less_than_itself,axiom,
~ less(A,A),
file('theBenchmark.p',no_number_less_than_itself) ).
cnf(a_less_than_b,hypothesis,
less(a,b),
file('theBenchmark.p',a_less_than_b) ).
cnf(prove_b_not_less_than_a,negated_conjecture,
less(b,a),
file('theBenchmark.p',prove_b_not_less_than_a) ).
cnf(t1,plain,
~ less(a,a),
inference(start,[status(thm),parent(0:0)],[no_number_less_than_itself]) ).
cnf(t2,plain,
( ~ less(a,b)
| ~ less(b,a)
| less(a,a) ),
inference(extension,[status(thm),parent(t1:1)],[transitivity_of_less]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
less(b,a),
inference(extension,[status(thm),parent(t2:2)],[prove_b_not_less_than_a]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
less(a,b),
inference(extension,[status(thm),parent(t2:3)],[a_less_than_b]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM025-1 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 19 17:36:26 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------