%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN031-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 : n012.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:35:20 PM UTC 2026
% Result : Unsatisfiable 0.12s 1.51s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 4 unt; 5 nHn; 13 RR)
% Number of literals : 32 ( 0 equ; 15 neg)
% Maximal clause size : 2 ( 1 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-1 aty)
% Number of variables : 25 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause3,axiom,
( g(f(X2),X2)
| ~ g(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause4,axiom,
( g(X2,f(X2))
| ~ g(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(theorem,negated_conjecture,
( ~ g(X1,X2)
| ~ g(X2,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem) ).
cnf(clause1,axiom,
( g(X1,a)
| g(f(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(clause2,axiom,
( g(X1,a)
| g(X1,f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).
cnf(i_0_5,axiom,
( g(f(X2),X2)
| ~ g(X1,X2) ),
clause3,
[final] ).
cnf(i_0_6,axiom,
( g(X2,f(X2))
| ~ g(X1,X2) ),
clause4,
[final] ).
cnf(i_0_7,negated_conjecture,
( ~ g(X1,X2)
| ~ g(X2,a) ),
theorem,
[final] ).
cnf(i_0_8,axiom,
( g(X1,a)
| g(f(X1),X1) ),
clause1,
[final] ).
cnf(i_0_9,axiom,
( g(X1,a)
| g(X1,f(X1)) ),
clause2,
[final] ).
cnf(i_0_10,plain,
( ~ g(X1,X2)
| ~ g(f(X2),a) ),
inference(scs_inference,[],[i_0_7,i_0_6]) ).
cnf(i_0_11,plain,
( g(f(X1),X1)
| g(f(a),a) ),
inference(scs_inference,[],[i_0_5,i_0_8]) ).
cnf(i_0_12,plain,
( ~ g(f(f(X1)),a)
| g(X1,a) ),
inference(scs_inference,[],[i_0_9,i_0_10]) ).
cnf(i_0_13,plain,
~ g(X1,f(a)),
inference(scs_inference,[],[i_0_11,i_0_7]) ).
cnf(i_0_14,plain,
~ g(X1,a),
inference(scs_inference,[],[i_0_13,i_0_6]) ).
cnf(i_0_15,plain,
~ g(X1,f(a)),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_16,plain,
( g(X1,f(X1))
| ~ g(X2,X1) ),
inference(rename_variables,[],[i_0_6]) ).
cnf(i_0_17,plain,
$false,
inference(scs_inference,[],[i_0_13,i_0_15,i_0_6,i_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN031-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.06 % 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.06/0.24 % Computer : n012.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Tue May 5 08:04:46 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 0.12/1.51 % Version : CSE_E---1.7
% 0.12/1.51 % Problem : theBenchmark.p
% 0.12/1.51 % SZS status Unsatisfiable for theBenchmark.p
% 0.12/1.51 % SZS output start CNFRefutation
% See solution above
% 0.12/1.52 % Total time : 1.261s
%------------------------------------------------------------------------------