%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV006-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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 09:02:26 AM UTC 2026
% Result : Unsatisfiable 0.13s 5.43s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 25 ( 0 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(less_than_successor,axiom,
less_than(X,successor(X)),
file('SWV001-0.ax',less_than_successor) ).
cnf(transitivity_of_less_than,axiom,
( ~ less_than(Y,Z)
| ~ less_than(X,Y)
| less_than(X,Z) ),
file('SWV001-0.ax',transitivity_of_less_than) ).
cnf(x_not_less_than_x,axiom,
~ less_than(X,X),
file('SWV001-0.ax',x_not_less_than_x) ).
cnf(clause_3,negated_conjecture,
less_than(i,n),
file('theBenchmark.p',clause_3) ).
cnf(clause_5,negated_conjecture,
less_than(a(i),a(m)),
file('theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
( ~ less_than(a(X),a(m))
| ~ less_than(X,successor(n))
| less_than(X,i) ),
file('theBenchmark.p',clause_6) ).
cnf(t1,plain,
~ less_than(i,i),
inference(start,[status(thm),parent(0:0)],[x_not_less_than_x]) ).
cnf(t2,plain,
( ~ less_than(i,successor(n))
| ~ less_than(a(i),a(m))
| less_than(i,i) ),
inference(extension,[status(thm),parent(t1:1)],[clause_6]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
less_than(a(i),a(m)),
inference(extension,[status(thm),parent(t2:2)],[clause_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ less_than(i,n)
| ~ less_than(n,successor(n))
| less_than(i,successor(n)) ),
inference(extension,[status(thm),parent(t2:3)],[transitivity_of_less_than]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
less_than(n,successor(n)),
inference(extension,[status(thm),parent(t6:2)],[less_than_successor]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
less_than(i,n),
inference(extension,[status(thm),parent(t6:3)],[clause_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36 % Computer : n014.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sun Sep 20 02:58:55 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.13/5.43 % SZS status Unsatisfiable for theBenchmark
% 0.13/5.43 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------