%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET838-1 : TPTP v9.2.1. Released v3.2.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 : n027.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:08:39 PM UTC 2026
% Result : Unsatisfiable 1.49s 1.83s
% Output : CNFRefutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 6 unt; 0 nHn; 12 RR)
% Number of literals : 18 ( 17 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
( v_g(v_f(v_xa(X1))) = v_xa(X1)
| v_g(v_f(X1)) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
v_f(v_g(v_x)) = v_x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( X1 = v_x
| v_f(v_g(X1)) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_3,negated_conjecture,
( v_xa(X1) != X1
| v_g(v_f(X1)) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_4,negated_conjecture,
( v_g(v_f(v_xa(X1))) = v_xa(X1)
| v_g(v_f(X1)) != X1 ),
cls_conjecture_2 ).
cnf(c_0_5,negated_conjecture,
v_f(v_g(v_x)) = v_x,
cls_conjecture_0 ).
cnf(c_0_6,negated_conjecture,
( X1 = v_x
| v_f(v_g(X1)) != X1 ),
cls_conjecture_1 ).
cnf(c_0_7,negated_conjecture,
v_g(v_f(v_xa(v_g(v_x)))) = v_xa(v_g(v_x)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
v_f(v_xa(v_g(v_x))) = v_x,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( v_xa(X1) != X1
| v_g(v_f(X1)) != X1 ),
cls_conjecture_3 ).
cnf(c_0_10,negated_conjecture,
v_xa(v_g(v_x)) = v_g(v_x),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET838-1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11 % 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.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue May 5 02:37:20 EDT 2026
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % start to proof: theBenchmark
% 1.49/1.83 % Version : CSE_E---1.7
% 1.49/1.83 % Problem : theBenchmark.p
% 1.49/1.83 % SZS status Unsatisfiable for theBenchmark.p
% 1.49/1.83 % SZS output start CNFRefutation
% See solution above
% 1.49/1.83 % Total time : 1.428s
%------------------------------------------------------------------------------