%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV007-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 : n025.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 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 13 unt; 2 nHn; 18 RR)
% Number of literals : 37 ( 3 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(anti_symmetry_of_less_than,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',anti_symmetry_of_less_than) ).
cnf(clause_5,negated_conjecture,
less_than(i,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_11,negated_conjecture,
( less_than(X1,i)
| ~ less_than(X1,successor(n))
| ~ less_than(a(X1),a(k)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).
cnf(clause_8,negated_conjecture,
less_than(a(m),a(k)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).
cnf(transitivity_of_less_than,axiom,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).
cnf(less_than_successor,axiom,
less_than(X1,successor(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).
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_4,negated_conjecture,
~ less_than(n,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(c_0_8,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
anti_symmetry_of_less_than ).
cnf(c_0_9,negated_conjecture,
less_than(i,m),
clause_5 ).
cnf(c_0_10,negated_conjecture,
( less_than(X1,i)
| ~ less_than(X1,successor(n))
| ~ less_than(a(X1),a(k)) ),
clause_11 ).
cnf(c_0_11,negated_conjecture,
less_than(a(m),a(k)),
clause_8 ).
cnf(c_0_12,negated_conjecture,
~ less_than(m,i),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,axiom,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X3,X2) ),
transitivity_of_less_than ).
cnf(c_0_14,axiom,
less_than(X1,successor(X1)),
less_than_successor ).
cnf(c_0_15,negated_conjecture,
~ less_than(m,successor(n)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
( less_than(X1,successor(X2))
| ~ less_than(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ less_than(m,n),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
all_related ).
cnf(c_0_19,negated_conjecture,
~ less_than(n,m),
clause_4 ).
cnf(c_0_20,negated_conjecture,
m = n,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_20]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV007-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n025.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:53:43 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------