%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN077-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 : n023.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:04 PM UTC 2026
% Result : Unsatisfiable 1.20s 1.67s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 3 unt; 6 nHn; 22 RR)
% Number of literals : 66 ( 5 equ; 40 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( big_f(i(X2,X1),X1)
| big_f(X2,a)
| ~ big_f(X1,h(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,axiom,
( X1 = X2
| ~ big_f(X1,f(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,negated_conjecture,
( big_f(g(X1,X2),X2)
| ~ big_f(X1,a)
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_7,negated_conjecture,
( big_f(X1,a)
| big_f(i(X1,X2),h(X1))
| ~ big_f(X2,h(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_2,axiom,
( big_f(X1,f(X2))
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,negated_conjecture,
( big_f(X1,h(X1))
| big_f(X1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(c_0_7,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X3,X2) ),
clause_4 ).
cnf(c_0_8,negated_conjecture,
( big_f(i(X2,X1),X1)
| big_f(X2,a)
| ~ big_f(X1,h(X2)) ),
clause_6 ).
cnf(c_0_9,axiom,
( X1 = X2
| ~ big_f(X1,f(X2)) ),
clause_1 ).
cnf(c_0_10,negated_conjecture,
( big_f(g(X1,X2),X2)
| ~ big_f(X1,a)
| ~ big_f(X1,X2) ),
clause_3 ).
cnf(c_0_11,negated_conjecture,
( big_f(X1,a)
| ~ big_f(i(X1,g(X2,X3)),X3)
| ~ big_f(g(X2,X3),h(X1))
| ~ big_f(X2,a)
| ~ big_f(X2,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( big_f(X1,a)
| big_f(i(X1,X2),h(X1))
| ~ big_f(X2,h(X1)) ),
clause_7 ).
cnf(c_0_13,negated_conjecture,
( g(X1,f(X2)) = X2
| ~ big_f(X1,f(X2))
| ~ big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( big_f(X1,f(X2))
| X1 != X2 ),
clause_2 ).
cnf(c_0_15,negated_conjecture,
( big_f(X1,a)
| ~ big_f(X2,h(X1))
| ~ big_f(X2,a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_f(X1,f(X2))
| ~ big_f(X3,f(X2))
| ~ big_f(X3,a)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,plain,
big_f(X1,f(X1)),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( big_f(X1,a)
| ~ big_f(i(X1,X2),a)
| ~ big_f(X2,h(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_f(X1,f(X2))
| ~ big_f(X1,a)
| ~ big_f(X2,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( big_f(X1,a)
| ~ big_f(a,h(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( big_f(X1,h(X1))
| big_f(X1,a) ),
clause_5 ).
cnf(c_0_22,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
big_f(a,a),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN077-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.09 % 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.11/0.29 % Computer : n023.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue May 5 08:12:23 EDT 2026
% 0.11/0.29 % CPUTime :
% 0.11/0.30 % start to proof: theBenchmark
% 1.20/1.67 % Version : CSE_E---1.7
% 1.20/1.67 % Problem : theBenchmark.p
% 1.20/1.67 % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.67 % SZS output start CNFRefutation
% See solution above
% 1.20/1.67 % Total time : 1.367s
%------------------------------------------------------------------------------