%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN075-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 : n008.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.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 4 unt; 6 nHn; 16 RR)
% Number of literals : 48 ( 29 equ; 25 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_4,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_9,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).
cnf(clause_10,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).
cnf(clause_1,axiom,
( X1 = a
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,axiom,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(c_0_6,negated_conjecture,
( f(X2) = X2
| ~ big_f(X1,f(X2))
| X1 != g(X2) ),
clause_4 ).
cnf(c_0_7,negated_conjecture,
( big_f(X1,f(X2))
| f(X2) = X2
| X1 != g(X2) ),
clause_6 ).
cnf(c_0_8,negated_conjecture,
( f(X1) = X1
| ~ big_f(g(X1),f(X1)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( big_f(h(X1,X2),f(X1))
| h(X1,X2) = X2
| f(X1) != X1 ),
clause_9 ).
cnf(c_0_10,negated_conjecture,
f(X1) = X1,
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_7]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( f(X1) != X1
| h(X1,X2) != X2
| ~ big_f(h(X1,X2),f(X1)) ),
clause_10 ).
cnf(c_0_12,axiom,
( X1 = a
| ~ big_f(X1,X2) ),
clause_1 ).
cnf(c_0_13,negated_conjecture,
( h(X1,X2) = X2
| big_f(h(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10])]) ).
cnf(c_0_14,negated_conjecture,
( h(X1,X2) != X2
| ~ big_f(h(X1,X2),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10])]) ).
cnf(c_0_15,negated_conjecture,
( h(X1,X2) = a
| h(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( big_f(X1,X2)
| X1 != a
| X2 != b ),
clause_3 ).
cnf(c_0_17,negated_conjecture,
( h(X1,X2) = a
| ~ big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
big_f(a,b),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
~ big_f(a,X1),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17])]) ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN075-1 : TPTP v9.2.1. Released v1.0.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.16/0.33 % Computer : n008.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 08:11:58 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.373s
%------------------------------------------------------------------------------