%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV001-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 : n026.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.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 7 unt; 6 nHn; 20 RR)
% Number of literals : 54 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 37 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_2,axiom,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,negated_conjecture,
q1(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_3,axiom,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,axiom,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_6,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(less_or_equal_reflexivity,axiom,
less_or_equalish(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_reflexivity) ).
cnf(all_less_or_equal,axiom,
( less_or_equalish(X1,X2)
| less_or_equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_less_or_equal) ).
cnf(clause_7,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(c_0_9,axiom,
( less_or_equalish(X1,X2)
| q3(X1,X2,X3)
| ~ q1(X1,X2,X3) ),
clause_2 ).
cnf(c_0_10,negated_conjecture,
q1(a,b,c),
clause_5 ).
cnf(c_0_11,axiom,
( q4(X1,X2,X1)
| ~ q3(X1,X2,X3) ),
clause_4 ).
cnf(c_0_12,negated_conjecture,
( q3(a,b,c)
| less_or_equalish(a,b) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( q4(X1,X2,X2)
| ~ q2(X1,X2,X3) ),
clause_3 ).
cnf(c_0_14,axiom,
( q2(X1,X2,X3)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
clause_1 ).
cnf(c_0_15,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,a) ),
clause_6 ).
cnf(c_0_16,negated_conjecture,
( q4(a,b,a)
| less_or_equalish(a,b) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
less_or_equalish(X1,X1),
less_or_equal_reflexivity ).
cnf(c_0_18,axiom,
( less_or_equalish(X1,X2)
| less_or_equalish(X2,X1) ),
all_less_or_equal ).
cnf(c_0_19,plain,
( q4(X1,X2,X2)
| ~ q1(X1,X2,X3)
| ~ less_or_equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
less_or_equalish(a,b),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ q4(a,b,X1)
| ~ less_or_equalish(a,X1)
| ~ less_or_equalish(b,X1)
| ~ less_or_equalish(X1,b) ),
clause_7 ).
cnf(c_0_22,negated_conjecture,
q4(a,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV001-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.16/0.33 % Computer : n026.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:53:08 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------