%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL433-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:19:27 PM UTC 2026
% Result : Unsatisfiable 0.23s 5.56s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 12 unt; 0 nHn; 21 RR)
% Number of literals : 47 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 62 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_Osat__imp_0,axiom,
( ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3)
| c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Osat__imp_0) ).
cnf(cls_PropLog_Othms_OH_0,axiom,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_PropLog_Osat(v_F,X1,t_a)
| c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_PropLog_Othms_OMP_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OMP_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
cnf(cls_PropLog_Oweaken__left__insert_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_8,plain,
( ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3)
| c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Osat__imp_0]) ).
cnf(c_0_9,plain,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).
cnf(c_0_10,negated_conjecture,
( ~ c_PropLog_Osat(v_F,X1,t_a)
| c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_11,plain,
( ~ c_PropLog_Osat(c_insert(X1,X2,tc_PropLog_Opl(X3)),X4,X3)
| c_PropLog_Osat(X2,c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
cls_conjecture_2 ).
cnf(c_0_13,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OMP_0]) ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_9 ).
cnf(c_0_15,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_16,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left__insert_0]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_PropLog_Osat(v_F,X1,t_a)
| c_in(X1,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)) ),
c_0_10 ).
cnf(c_0_18,negated_conjecture,
c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_13 ).
cnf(c_0_20,plain,
c_in(X1,c_PropLog_Othms(c_insert(X1,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(X4,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_24,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),c_PropLog_Othms(c_insert(X1,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL433-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.46 % Computer : n026.cluster.edu
% 0.17/5.46 % Model : x86_64 x86_64
% 0.17/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.46 % Memory : 8046.5625MB
% 0.17/5.46 % OS : Linux 6.8.0-71-generic
% 0.17/5.46 % CPULimit : 300
% 0.17/5.46 % WCLimit : 300
% 0.17/5.46 % DateTime : Mon Sep 21 00:34:57 UTC 2026
% 0.17/5.46 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.53 Running first-order theorem proving
% 0.23/5.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/5.56 % Version: 3.5.1
% 0.23/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.56 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.56 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.56 % Starting sh5l with 300s (1) cores
% 0.23/5.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 982754 completed with status 0
% 0.23/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.56 % No SInE strategy applied
% 0.23/5.56 % Search class: FHUNF-FFSF32-MFFFFFNN
% 0.23/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.56 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/5.56 % Starting new_bool_3 with 136s (1) cores
% 0.23/5.56 % Starting new_bool_1 with 136s (1) cores
% 0.23/5.56 % new_bool_1 with pid 982765 completed with status 0
% 0.23/5.56 % Result found by new_bool_1
% 0.23/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.56 % No SInE strategy applied
% 0.23/5.56 % Search class: FHUNF-FFSF32-MFFFFFNN
% 0.23/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.56 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/5.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/5.56 % Starting new_bool_3 with 136s (1) cores
% 0.23/5.56 % Starting new_bool_1 with 136s (1) cores
% 0.23/5.56 % Preprocessing time : 0.002 s
% 0.23/5.56 % Presaturation interreduction done
% 0.23/5.56
% 0.23/5.56 % Proof found!
% 0.23/5.56 % SZS status Unsatisfiable
% 0.23/5.56 % SZS output start CNFRefutation
% See solution above
% 0.23/5.56 % Parsed axioms : 8
% 0.23/5.56 % Removed by relevancy pruning/SinE : 0
% 0.23/5.56 % Initial clauses : 8
% 0.23/5.56 % Removed in clause preprocessing : 0
% 0.23/5.56 % Initial clauses in saturation : 8
% 0.23/5.56 % Processed clauses : 29
% 0.23/5.56 % ...of these trivial : 0
% 0.23/5.56 % ...subsumed : 0
% 0.23/5.56 % ...remaining for further processing : 29
% 0.23/5.56 % Other redundant clauses eliminated : 0
% 0.23/5.56 % Clauses deleted for lack of memory : 0
% 0.23/5.56 % Backward-subsumed : 0
% 0.23/5.56 % Backward-rewritten : 0
% 0.23/5.56 % Generated clauses : 34
% 0.23/5.56 % ...of the previous two non-redundant : 33
% 0.23/5.56 % ...aggressively subsumed : 0
% 0.23/5.56 % Contextual simplify-reflections : 0
% 0.23/5.56 % Paramodulations : 34
% 0.23/5.56 % Factorizations : 0
% 0.23/5.56 % NegExts : 0
% 0.23/5.56 % Equation resolutions : 0
% 0.23/5.56 % Disequality decompositions : 0
% 0.23/5.56 % Total rewrite steps : 0
% 0.23/5.56 % ...of those cached : 0
% 0.23/5.56 % Propositional unsat checks : 0
% 0.23/5.56 % Propositional check models : 0
% 0.23/5.56 % Propositional check unsatisfiable : 0
% 0.23/5.56 % Propositional clauses : 0
% 0.23/5.56 % Propositional clauses after purity: 0
% 0.23/5.56 % Propositional unsat core size : 0
% 0.23/5.56 % Propositional preprocessing time : 0.000
% 0.23/5.56 % Propositional encoding time : 0.000
% 0.23/5.56 % Propositional solver time : 0.000
% 0.23/5.56 % Success case prop preproc time : 0.000
% 0.23/5.56 % Success case prop encoding time : 0.000
% 0.23/5.56 % Success case prop solver time : 0.000
% 0.23/5.56 % Current number of processed clauses : 21
% 0.23/5.56 % Positive orientable unit clauses : 13
% 0.23/5.56 % Positive unorientable unit clauses: 0
% 0.23/5.56 % Negative unit clauses : 1
% 0.23/5.56 % Non-unit-clauses : 7
% 0.23/5.56 % Current number of unprocessed clauses: 17
% 0.23/5.56 % ...number of literals in the above : 24
% 0.23/5.56 % Current number of archived formulas : 0
% 0.23/5.56 % Current number of archived clauses : 8
% 0.23/5.56 % Clause-clause subsumption calls (NU) : 12
% 0.23/5.56 % Rec. Clause-clause subsumption calls : 12
% 0.23/5.56 % Non-unit clause-clause subsumptions : 0
% 0.23/5.56 % Unit Clause-clause subsumption calls : 0
% 0.23/5.56 % Rewrite failures with RHS unbound : 0
% 0.23/5.56 % BW rewrite match attempts : 17
% 0.23/5.56 % BW rewrite match successes : 0
% 0.23/5.56 % Condensation attempts : 0
% 0.23/5.56 % Condensation successes : 0
% 0.23/5.56 % Termbank termtop insertions : 1142
% 0.23/5.56 % Search garbage collected termcells : 17
% 0.23/5.56
% 0.23/5.56 % -------------------------------------------------
% 0.23/5.56 % User time : 0.005 s
% 0.23/5.56 % System time : 0.005 s
% 0.23/5.56 % Total time : 0.011 s
% 0.23/5.56 % Maximum resident set size: 3636 pages
% 0.23/5.56
% 0.23/5.56 % -------------------------------------------------
% 0.23/5.56 % User time : 0.034 s
% 0.23/5.56 % System time : 0.014 s
% 0.23/5.56 % Total time : 0.048 s
% 0.23/5.56 % Maximum resident set size: 4864 pages
% 0.23/5.56 % E exiting
%------------------------------------------------------------------------------