%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN347-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n001.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:36:53 PM UTC 2026
% Result : Unsatisfiable 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 4 unt; 12 nHn; 17 RR)
% Number of literals : 51 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause2,negated_conjecture,
( f(X2,y(X1,X2))
| f(a,b)
| ~ f(X1,y(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause5,negated_conjecture,
( f(a,y(X1,X2))
| f(b,y(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause1,negated_conjecture,
( f(X1,y(X1,X2))
| f(a,b)
| ~ f(X2,y(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause6,negated_conjecture,
( ~ f(a,y(X1,X2))
| ~ f(b,y(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause3,negated_conjecture,
( ~ f(X1,y(X1,X2))
| ~ f(X2,y(X1,X2))
| ~ f(a,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause4,negated_conjecture,
( f(X1,y(X1,X2))
| f(X2,y(X1,X2))
| ~ f(a,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(c_0_6,negated_conjecture,
( f(X2,y(X1,X2))
| f(a,b)
| ~ f(X1,y(X1,X2)) ),
clause2 ).
cnf(c_0_7,negated_conjecture,
( f(a,y(X1,X2))
| f(b,y(X1,X2)) ),
clause5 ).
cnf(c_0_8,negated_conjecture,
( f(b,y(a,X1))
| f(X1,y(a,X1))
| f(a,b) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( f(X1,y(X1,X2))
| f(a,b)
| ~ f(X2,y(X1,X2)) ),
clause1 ).
cnf(c_0_10,negated_conjecture,
( f(b,y(a,b))
| f(a,b) ),
inference(ef,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ f(a,y(X1,X2))
| ~ f(b,y(X1,X2)) ),
clause6 ).
cnf(c_0_12,negated_conjecture,
( f(a,y(a,b))
| f(a,b) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ f(X1,y(X1,X2))
| ~ f(X2,y(X1,X2))
| ~ f(a,b) ),
clause3 ).
cnf(c_0_14,negated_conjecture,
f(a,b),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( f(X1,y(X1,X2))
| f(X2,y(X1,X2))
| ~ f(a,b) ),
clause4 ).
cnf(c_0_16,negated_conjecture,
( ~ f(X1,y(X2,X1))
| ~ f(X2,y(X2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
( f(X1,y(X1,X2))
| f(X2,y(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_14])]) ).
cnf(c_0_18,negated_conjecture,
( f(b,y(X1,a))
| ~ f(X1,y(X1,a)) ),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( f(X1,y(X1,a))
| ~ f(b,y(X1,a)) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
f(b,y(a,a)),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_21,negated_conjecture,
f(a,y(a,a)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN347-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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.15/0.33 % Computer : n001.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 08:30:03 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------