%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWV009-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 : n011.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.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 12 unt; 2 nHn; 19 RR)
% Number of literals : 44 ( 0 equ; 27 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_9,negated_conjecture,
~ less_or_equal(a(p),a(q)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_6,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X2)
| ~ less_or_equal(X2,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_5,negated_conjecture,
less_or_equal(q,n),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_3,negated_conjecture,
less_or_equal(m,p),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_7,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,j) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_4,negated_conjecture,
less_or_equal(p,q),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_1,negated_conjecture,
( less_or_equal(X1,X2)
| less(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_8,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(i,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,n) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
cnf(c_0_8,negated_conjecture,
~ less_or_equal(a(p),a(q)),
clause_9 ).
cnf(c_0_9,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less(X1,i)
| ~ less(j,X2)
| ~ less_or_equal(X2,n) ),
clause_6 ).
cnf(c_0_10,negated_conjecture,
less_or_equal(q,n),
clause_5 ).
cnf(c_0_11,negated_conjecture,
less_or_equal(m,p),
clause_3 ).
cnf(c_0_12,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(m,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,j) ),
clause_7 ).
cnf(c_0_13,negated_conjecture,
less_or_equal(p,q),
clause_4 ).
cnf(c_0_14,negated_conjecture,
( ~ less(p,i)
| ~ less(j,q) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_15,negated_conjecture,
( less_or_equal(X1,X2)
| less(X2,X1) ),
clause_1 ).
cnf(c_0_16,negated_conjecture,
~ less_or_equal(q,j),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_11]),c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
( less_or_equal(a(X1),a(X2))
| ~ less_or_equal(i,X1)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,n) ),
clause_8 ).
cnf(c_0_18,negated_conjecture,
~ less(p,i),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ less_or_equal(i,p),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_17]),c_0_10]),c_0_13])]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV009-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 : n011.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:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------