%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYO614-1 : TPTP v9.2.1. Released v7.1.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 : n016.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:54:03 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.71s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 8 unt; 2 nHn; 17 RR)
% Number of literals : 48 ( 0 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 48 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_03,axiom,
( le(X2,X3)
| ~ le(max(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
cnf(sos_01,axiom,
le(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
cnf(sos_02,axiom,
( le(X1,X3)
| ~ le(max(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
cnf(sos_06,axiom,
( ~ eq(f(X1),a1)
| ~ eq(f(X2),a1)
| ~ le(s(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
cnf(sos_05,axiom,
( ~ eq(f(X1),a0)
| ~ eq(f(X2),a0)
| ~ le(s(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
cnf(sos_04,axiom,
( eq(f(X1),a0)
| eq(f(X1),a1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
cnf(c_0_6,axiom,
( le(X2,X3)
| ~ le(max(X1,X2),X3) ),
sos_03 ).
cnf(c_0_7,axiom,
le(X1,X1),
sos_01 ).
cnf(c_0_8,axiom,
( le(X1,X3)
| ~ le(max(X1,X2),X3) ),
sos_02 ).
cnf(c_0_9,axiom,
( ~ eq(f(X1),a1)
| ~ eq(f(X2),a1)
| ~ le(s(X1),X2) ),
sos_06 ).
cnf(c_0_10,plain,
le(X1,max(X2,X1)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,axiom,
( ~ eq(f(X1),a0)
| ~ eq(f(X2),a0)
| ~ le(s(X1),X2) ),
sos_05 ).
cnf(c_0_12,plain,
le(X1,max(X1,X2)),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,plain,
( ~ eq(f(max(X1,s(X2))),a1)
| ~ eq(f(X2),a1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( eq(f(X1),a0)
| eq(f(X1),a1) ),
sos_04 ).
cnf(c_0_15,plain,
( ~ eq(f(max(s(X1),X2)),a0)
| ~ eq(f(X1),a0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( eq(f(max(X1,s(X2))),a0)
| ~ eq(f(X2),a1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ eq(f(s(X1)),a1)
| ~ eq(f(X1),a1) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_18,plain,
( ~ eq(f(X1),a0)
| ~ eq(f(X2),a1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( eq(f(s(X1)),a0)
| ~ eq(f(X1),a1) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_20,plain,
( ~ eq(f(X1),a1)
| ~ eq(f(X2),a1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
le(X1,max(max(X2,X1),X3)),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_22,plain,
~ eq(f(X1),a1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_18]) ).
cnf(c_0_23,plain,
( ~ eq(f(max(max(X1,s(X2)),X3)),a0)
| ~ eq(f(X2),a0) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_24,plain,
eq(f(X1),a0),
inference(sr,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_25,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO614-1 : TPTP v9.2.1. Released v7.1.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 : n016.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 09:18:06 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.23/1.71 % Version : CSE_E---1.7
% 1.23/1.71 % Problem : theBenchmark.p
% 1.23/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71 % SZS output start CNFRefutation
% See solution above
% 1.23/1.71 % Total time : 1.370s
%------------------------------------------------------------------------------