%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV008-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n017.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:35 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 13 unt; 5 nHn; 18 RR)
% Number of literals : 36 ( 3 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_5,negated_conjecture,
( ~ less_than(one,X1)
| ~ less_than(X1,n)
| ~ less_than(a(X1),a(predecessor(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_3,negated_conjecture,
less_than(a(l),a(predecessor(l))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,negated_conjecture,
less_than(one,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(all_related,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',all_related) ).
cnf(clause_1,negated_conjecture,
~ less_than(n,l),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_4,negated_conjecture,
( less_than(X1,n)
| less_than(n,X1)
| ~ less_than(one,n)
| ~ less_than(a(X1),a(predecessor(n))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(x_not_less_than_x,axiom,
~ less_than(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',x_not_less_than_x) ).
cnf(c_0_7,negated_conjecture,
( ~ less_than(one,X1)
| ~ less_than(X1,n)
| ~ less_than(a(X1),a(predecessor(X1))) ),
clause_5 ).
cnf(c_0_8,negated_conjecture,
less_than(a(l),a(predecessor(l))),
clause_3 ).
cnf(c_0_9,negated_conjecture,
less_than(one,l),
clause_2 ).
cnf(c_0_10,negated_conjecture,
~ less_than(l,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
all_related ).
cnf(c_0_12,negated_conjecture,
~ less_than(n,l),
clause_1 ).
cnf(c_0_13,negated_conjecture,
l = n,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( less_than(X1,n)
| less_than(n,X1)
| ~ less_than(one,n)
| ~ less_than(a(X1),a(predecessor(n))) ),
clause_4 ).
cnf(c_0_15,negated_conjecture,
less_than(one,n),
inference(rw,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( less_than(n,X1)
| less_than(X1,n)
| ~ less_than(a(X1),a(predecessor(n))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
less_than(a(n),a(predecessor(n))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_13]),c_0_13]) ).
cnf(c_0_18,axiom,
~ less_than(X1,X1),
x_not_less_than_x ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV008-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n017.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:52:13 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------