%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL431-2 : 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 : n013.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 04:40:19 PM UTC 2026
% Result : Unsatisfiable 1.21s 1.73s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 6 RR)
% Number of literals : 13 ( 2 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 14 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Ocompleteness__0__lemma__dest_0,axiom,
( c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X3,X2),c_PropLog_Ohyps(X1,X4,X2),tc_set(tc_PropLog_Opl(X2))),X2),tc_PropLog_Opl(X2))
| ~ c_PropLog_Osat(c_emptyset,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Ocompleteness__0__lemma__dest_0) ).
cnf(cls_Set_ODiff__cancel_0,axiom,
c_minus(X1,X1,tc_set(X2)) = c_emptyset,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_ODiff__cancel_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_PropLog_Osat(c_emptyset,v_p,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_4,axiom,
( c_in(X1,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(X1,X3,X2),c_PropLog_Ohyps(X1,X4,X2),tc_set(tc_PropLog_Opl(X2))),X2),tc_PropLog_Opl(X2))
| ~ c_PropLog_Osat(c_emptyset,X1,X2) ),
cls_PropLog_Ocompleteness__0__lemma__dest_0 ).
cnf(c_0_5,axiom,
c_minus(X1,X1,tc_set(X2)) = c_emptyset,
cls_Set_ODiff__cancel_0 ).
cnf(c_0_6,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_1 ).
cnf(c_0_7,plain,
( c_in(X1,c_PropLog_Othms(c_emptyset,X2),tc_PropLog_Opl(X2))
| ~ c_PropLog_Osat(c_emptyset,X1,X2) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,negated_conjecture,
c_PropLog_Osat(c_emptyset,v_p,t_a),
cls_conjecture_0 ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : LCL431-2 : TPTP v9.2.1. Released v3.2.0.
% 0.10/0.13 % 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.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 4 22:34:56 EDT 2026
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % start to proof: theBenchmark
% 1.21/1.73 % Version : CSE_E---1.7
% 1.21/1.73 % Problem : theBenchmark.p
% 1.21/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.21/1.73 % SZS output start CNFRefutation
% See solution above
% 1.21/1.73 % Total time : 1.373s
%------------------------------------------------------------------------------