%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN350-1 : TPTP v9.2.1. Released v1.2.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 : n022.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 0.27s 1.62s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 3 unt; 5 nHn; 23 RR)
% Number of literals : 56 ( 0 equ; 33 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause4,negated_conjecture,
( f(X1,z(X1,X2))
| ~ f(a,z(X1,X2))
| ~ f(X2,z(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(clause6,negated_conjecture,
( ~ f(a,z(X1,X2))
| ~ f(X2,z(X1,X2))
| ~ f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).
cnf(clause3,negated_conjecture,
( f(a,z(X1,X2))
| f(X2,z(X1,X2))
| f(X1,z(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause5,negated_conjecture,
( f(a,z(X1,X2))
| f(X2,z(X1,X2))
| ~ f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause1,negated_conjecture,
( f(z(X1,X2),a)
| ~ f(a,z(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause2,negated_conjecture,
( f(a,z(X1,X2))
| ~ f(z(X1,X2),a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(i_0_6,negated_conjecture,
( f(X1,z(X1,X2))
| ~ f(a,z(X1,X2))
| ~ f(X2,z(X1,X2)) ),
clause4,
[final] ).
cnf(i_0_7,negated_conjecture,
( ~ f(a,z(X1,X2))
| ~ f(X2,z(X1,X2))
| ~ f(X1,X2) ),
clause6,
[final] ).
cnf(i_0_8,negated_conjecture,
( f(a,z(X1,X2))
| f(X2,z(X1,X2))
| f(X1,z(X1,X2)) ),
clause3,
[final] ).
cnf(i_0_9,negated_conjecture,
( f(a,z(X1,X2))
| f(X2,z(X1,X2))
| ~ f(X1,X2) ),
clause5,
[final] ).
cnf(i_0_10,negated_conjecture,
( f(z(X1,X2),a)
| ~ f(a,z(X1,X2)) ),
clause1,
[final] ).
cnf(i_0_11,negated_conjecture,
( f(a,z(X1,X2))
| ~ f(z(X1,X2),a) ),
clause2,
[final] ).
cnf(i_0_12,plain,
( ~ f(a,z(X1,X2))
| f(a,z(X1,X2)) ),
inference(scs_inference,[],[i_0_10,i_0_11]) ).
cnf(i_0_13,plain,
( ~ f(a,z(z(X1,X2),a))
| ~ f(a,z(X1,X2)) ),
inference(scs_inference,[],[i_0_7,i_0_10]) ).
cnf(i_0_14,plain,
( ~ f(a,z(z(X1,X2),a))
| ~ f(z(X1,X2),a) ),
inference(scs_inference,[],[i_0_13,i_0_11]) ).
cnf(i_0_15,plain,
( ~ f(z(X1,X2),a)
| ~ f(z(z(X1,X2),a),a) ),
inference(scs_inference,[],[i_0_14,i_0_11]) ).
cnf(i_0_16,plain,
( ~ f(z(z(X1,X2),a),a)
| ~ f(a,z(X1,X2)) ),
inference(scs_inference,[],[i_0_15,i_0_10]) ).
cnf(i_0_17,plain,
( f(X1,z(X2,X1))
| f(X2,z(X2,X1))
| ~ f(z(z(X2,X1),a),a) ),
inference(scs_inference,[],[i_0_16,i_0_8]) ).
cnf(i_0_18,plain,
( f(a,z(z(X1,X2),a))
| ~ f(a,z(X1,X2)) ),
inference(scs_inference,[],[i_0_9,i_0_10]) ).
cnf(i_0_19,plain,
( f(a,z(z(X1,X2),a))
| ~ f(z(X1,X2),a) ),
inference(scs_inference,[],[i_0_18,i_0_11]) ).
cnf(i_0_20,plain,
( ~ f(z(X1,X2),a)
| ~ f(a,z(X1,X2)) ),
inference(scs_inference,[],[i_0_19,i_0_13]) ).
cnf(i_0_21,plain,
~ f(a,z(X1,X2)),
inference(scs_inference,[],[i_0_20,i_0_10]) ).
cnf(i_0_22,plain,
~ f(z(X1,X2),a),
inference(scs_inference,[],[i_0_21,i_0_11]) ).
cnf(i_0_23,plain,
( f(a,z(X1,X2))
| ~ f(z(X1,X2),a) ),
inference(rename_variables,[],[i_0_11]) ).
cnf(i_0_24,plain,
$false,
inference(scs_inference,[],[i_0_21,i_0_11,i_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN350-1 : TPTP v9.2.1. Released v1.2.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.15/0.33 % Computer : n022.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:29:06 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.27/1.62 % Version : CSE_E---1.7
% 0.27/1.62 % Problem : theBenchmark.p
% 0.27/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.27/1.62 % SZS output start CNFRefutation
% See solution above
% 0.27/1.65 % Total time : 1.272s
%------------------------------------------------------------------------------