%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV002-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 : n005.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.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 13 unt; 5 nHn; 22 RR)
% Number of literals : 48 ( 8 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_6,negated_conjecture,
( less_than(X1,i)
| ~ less_than(X1,j)
| ~ less_than(a(X1),a(k)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
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(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(clause_11,negated_conjecture,
less_than(a(q),a(j)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
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(clause_5,negated_conjecture,
less_than(a(j),a(k)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_10,negated_conjecture,
~ less_than(j,q),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_9,negated_conjecture,
~ less_than(q,i),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
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(c_0_9,negated_conjecture,
( less_than(X1,i)
| ~ less_than(X1,j)
| ~ less_than(a(X1),a(k)) ),
clause_6 ).
cnf(c_0_10,axiom,
( less_than(X1,X2)
| less_than(X2,X1)
| X1 = X2 ),
all_related ).
cnf(c_0_11,axiom,
( less_than(X1,X2)
| ~ less_than(X1,X3)
| ~ less_than(X3,X2) ),
transitivity_of_less_than ).
cnf(c_0_12,negated_conjecture,
less_than(a(q),a(j)),
clause_11 ).
cnf(c_0_13,negated_conjecture,
( a(X1) = a(k)
| less_than(a(k),a(X1))
| less_than(X1,i)
| ~ less_than(X1,j) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( ~ less_than(X1,X2)
| ~ less_than(X2,X1) ),
anti_symmetry_of_less_than ).
cnf(c_0_15,negated_conjecture,
less_than(a(j),a(k)),
clause_5 ).
cnf(c_0_16,negated_conjecture,
( less_than(X1,a(j))
| ~ less_than(X1,a(q)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( a(X1) = a(k)
| X1 = j
| less_than(a(k),a(X1))
| less_than(j,X1)
| less_than(X1,i) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,negated_conjecture,
~ less_than(a(k),a(j)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ less_than(j,q),
clause_10 ).
cnf(c_0_20,negated_conjecture,
~ less_than(q,i),
clause_9 ).
cnf(c_0_21,negated_conjecture,
( a(q) = a(k)
| q = j ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
q = j,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_18]) ).
cnf(c_0_23,axiom,
~ less_than(X1,X1),
x_not_less_than_x ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV002-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.16/0.33 % Computer : n005.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 04:52:45 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------