%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL432-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 : 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 04:40:20 PM UTC 2026
% Result : Unsatisfiable 0.21s 1.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Ocompleteness__0_0,axiom,
( c_in(X1,c_PropLog_Othms(c_emptyset,X2),tc_PropLog_Opl(X2))
| ~ c_PropLog_Osat(c_emptyset,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Ocompleteness__0_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(v_x,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_x,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(i_0_3,axiom,
( c_in(X1,c_PropLog_Othms(c_emptyset,X2),tc_PropLog_Opl(X2))
| ~ c_PropLog_Osat(c_emptyset,X1,X2) ),
cls_PropLog_Ocompleteness__0_0,
[final] ).
cnf(i_0_4,negated_conjecture,
~ c_in(v_x,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_1,
[final] ).
cnf(i_0_5,negated_conjecture,
c_PropLog_Osat(c_emptyset,v_x,t_a),
cls_conjecture_0,
[final] ).
cnf(i_0_6,plain,
$false,
inference(scs_inference,[],[i_0_4,i_0_5,i_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL432-2 : 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 : Mon May 4 22:35:05 EDT 2026
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % start to proof: theBenchmark
% 0.21/1.61 % Version : CSE_E---1.7
% 0.21/1.61 % Problem : theBenchmark.p
% 0.21/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.21/1.61 % SZS output start CNFRefutation
% See solution above
% 0.21/1.62 % Total time : 1.274s
%------------------------------------------------------------------------------