%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV005-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n022.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:20:34 PM UTC 2026
% Result : Unsatisfiable 0.28s 1.63s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 32)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_9,negated_conjecture,
( ~ less_than(one,X1)
| ~ less_than(X1,l)
| ~ less_than(a(X1),a(predecessor(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_8,negated_conjecture,
( less_than(X1,l)
| less_than(n,X1)
| ~ less_than(one,l)
| ~ less_than(a(X1),a(predecessor(l))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(clause_7,negated_conjecture,
( less_than(X1,l)
| ~ less_than(X1,successor(n))
| ~ less_than(a(X1),a(k)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(transitivity_of_less_than,axiom,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).
cnf(anti_symmetry_of_less_than,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',anti_symmetry_of_less_than) ).
cnf(all_related,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',all_related) ).
cnf(clause_6,negated_conjecture,
less_than(a(k),a(predecessor(l))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(x_not_less_than_x,axiom,
~ less_than(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).
cnf(predecessor_less_than,axiom,
less_than(predecessor(X1),X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',predecessor_less_than) ).
cnf(less_than_successor,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).
cnf(clause_3,negated_conjecture,
~ less_than(k,i),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,negated_conjecture,
~ less_than(k,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_1,negated_conjecture,
~ less_than(n,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(well_defined_predecessor,axiom,
( X1 = X2
| predecessor(X1) != predecessor(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',well_defined_predecessor) ).
cnf(well_defined_successor,axiom,
( X1 = X2
| successor(X1) != successor(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',well_defined_successor) ).
cnf(clause_5,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,negated_conjecture,
less_than(l,n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(predecessor_successor,axiom,
predecessor(successor(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',predecessor_successor) ).
cnf(successor_predecessor,axiom,
successor(predecessor(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',successor_predecessor) ).
cnf(i_0_19,negated_conjecture,
( ~ less_than(one,X1)
| ~ less_than(X1,l)
| ~ less_than(a(X1),a(predecessor(X1))) ),
clause_9,
[final] ).
cnf(i_0_20,negated_conjecture,
( less_than(X1,l)
| less_than(n,X1)
| ~ less_than(one,l)
| ~ less_than(a(X1),a(predecessor(l))) ),
clause_8,
[final] ).
cnf(i_0_21,negated_conjecture,
( less_than(X1,l)
| ~ less_than(X1,successor(n))
| ~ less_than(a(X1),a(k)) ),
clause_7,
[final] ).
cnf(i_0_22,axiom,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X3,X2) ),
transitivity_of_less_than,
[final] ).
cnf(i_0_23,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
anti_symmetry_of_less_than,
[final] ).
cnf(i_0_24,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
all_related,
[final] ).
cnf(i_0_25,negated_conjecture,
less_than(a(k),a(predecessor(l))),
clause_6,
[final] ).
cnf(i_0_26,axiom,
~ less_than(X1,X1),
x_not_less_than_x,
[final] ).
cnf(i_0_27,axiom,
less_than(predecessor(X1),X1),
predecessor_less_than,
[final] ).
cnf(i_0_28,axiom,
less_than(X1,successor(X1)),
less_than_successor,
[final] ).
cnf(i_0_29,negated_conjecture,
~ less_than(k,i),
clause_3,
[final] ).
cnf(i_0_30,negated_conjecture,
~ less_than(k,l),
clause_2,
[final] ).
cnf(i_0_31,negated_conjecture,
~ less_than(n,k),
clause_1,
[final] ).
cnf(i_0_32,axiom,
( X1 = X2
| predecessor(X1) != predecessor(X2) ),
well_defined_predecessor,
[final] ).
cnf(i_0_33,axiom,
( X1 = X2
| successor(X1) != successor(X2) ),
well_defined_successor,
[final] ).
cnf(i_0_34,negated_conjecture,
less_than(one,l),
clause_5,
[final] ).
cnf(i_0_35,negated_conjecture,
less_than(l,n),
clause_4,
[final] ).
cnf(i_0_36,axiom,
predecessor(successor(X1)) = X1,
predecessor_successor,
[final] ).
cnf(i_0_37,axiom,
successor(predecessor(X1)) = X1,
successor_predecessor,
[final] ).
cnf(i_0_38,axiom,
X1 = X1 ).
cnf(i_0_39,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_40,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_41,axiom,
( X1 != X2
| predecessor(X1) = predecessor(X2) ) ).
cnf(i_0_42,axiom,
( X1 != X2
| successor(X1) = successor(X2) ) ).
cnf(i_0_43,axiom,
( X1 != X2
| ~ less_than(X1,X3)
| less_than(X2,X3) ) ).
cnf(i_0_44,axiom,
( X1 != X2
| ~ less_than(X3,X1)
| less_than(X3,X2) ) ).
cnf(i_0_38_001,axiom,
X1 = X1 ).
cnf(i_0_39_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_40_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_41_004,axiom,
( X1 != X2
| predecessor(X1) = predecessor(X2) ) ).
cnf(i_0_42_005,axiom,
( X1 != X2
| successor(X1) = successor(X2) ) ).
cnf(i_0_43_006,axiom,
( X1 != X2
| ~ less_than(X1,X3)
| less_than(X2,X3) ) ).
cnf(i_0_44_007,axiom,
( X1 != X2
| ~ less_than(X3,X1)
| less_than(X3,X2) ) ).
cnf(i_0_45,plain,
X1 = X1,
inference(equality_inference,[],[32]) ).
cnf(i_0_46,plain,
X1 = X1,
inference(equality_inference,[],[33]) ).
cnf(i_0_47,plain,
$false,
inference(scs_inference,[],[i_0_30,i_0_31,i_0_34,i_0_25,i_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV005-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.18/0.34 % Computer : n022.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Tue May 5 04:53:36 EDT 2026
% 0.18/0.34 % CPUTime :
% 0.18/0.35 % start to proof: theBenchmark
% 0.28/1.63 % Version : CSE_E---1.7
% 0.28/1.63 % Problem : theBenchmark.p
% 0.28/1.63 % SZS status Unsatisfiable for theBenchmark.p
% 0.28/1.63 % SZS output start CNFRefutation
% See solution above
% 0.28/1.64 % Total time : 1.275s
%------------------------------------------------------------------------------