%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SWV007-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 : n011.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.26s 0.50s
% Output : Proof 0.26s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(predecessor_successor,axiom,
predecessor(successor(X)) = X,
file('SWV001-0.ax',predecessor_successor) ).
cnf(successor_predecessor,axiom,
successor(predecessor(X)) = X,
file('SWV001-0.ax',successor_predecessor) ).
cnf(well_defined_predecessor,axiom,
( predecessor(X) != predecessor(Y)
| X = Y ),
file('SWV001-0.ax',well_defined_predecessor) ).
cnf(well_defined_successor,axiom,
( successor(X) != successor(Y)
| X = Y ),
file('SWV001-0.ax',well_defined_successor) ).
cnf(predecessor_less_than,axiom,
less_than(predecessor(X),X),
file('SWV001-0.ax',predecessor_less_than) ).
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(all_related,axiom,
( X = Y
| less_than(Y,X)
| less_than(X,Y) ),
file('SWV001-0.ax',all_related) ).
cnf(x_not_less_than_x,axiom,
~ less_than(X,X),
file('SWV001-0.ax',x_not_less_than_x) ).
cnf(anti_symmetry_of_less_than,axiom,
( ~ less_than(Y,X)
| ~ less_than(X,Y) ),
file('SWV001-0.ax',anti_symmetry_of_less_than) ).
cnf(equal_and_less_than_transitivity1,axiom,
( ~ less_than(X,Z)
| X != Y
| less_than(Y,Z) ),
file('SWV001-0.ax',equal_and_less_than_transitivity1) ).
cnf(equal_and_less_than_transitivity2,axiom,
( ~ less_than(Z,X)
| X != Y
| less_than(Z,Y) ),
file('SWV001-0.ax',equal_and_less_than_transitivity2) ).
cnf(clause_1,negated_conjecture,
~ less_than(n,k),
file('theBenchmark.p',clause_1) ).
cnf(clause_2,negated_conjecture,
~ less_than(k,i),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,negated_conjecture,
less_than(i,n),
file('theBenchmark.p',clause_3) ).
cnf(clause_4,negated_conjecture,
~ less_than(n,m),
file('theBenchmark.p',clause_4) ).
cnf(clause_5,negated_conjecture,
less_than(i,m),
file('theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
~ less_than(i,one),
file('theBenchmark.p',clause_6) ).
cnf(clause_7,negated_conjecture,
k != m,
file('theBenchmark.p',clause_7) ).
cnf(clause_8,negated_conjecture,
less_than(a(m),a(k)),
file('theBenchmark.p',clause_8) ).
cnf(clause_9,negated_conjecture,
( ~ less_than(a(X),a(predecessor(X)))
| ~ less_than(X,i)
| ~ less_than(one,X) ),
file('theBenchmark.p',clause_9) ).
cnf(clause_10,negated_conjecture,
( ~ less_than(a(X),a(predecessor(i)))
| ~ less_than(one,X)
| less_than(n,X)
| less_than(X,i) ),
file('theBenchmark.p',clause_10) ).
cnf(clause_11,negated_conjecture,
( ~ less_than(a(X),a(k))
| ~ less_than(X,successor(n))
| less_than(X,i) ),
file('theBenchmark.p',clause_11) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( successor(Eq_x_0) = successor(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( predecessor(Eq_x_0) = predecessor(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( a(Eq_x_0) = a(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( less_than(Eq_y_0,Eq_y_1)
| ~ less_than(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV007-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.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n011.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sun Sep 20 02:58:54 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.26/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.26/0.50 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------