%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL439-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:12:46 PM UTC 2026
% Result : Unsatisfiable 0.10s 5.58s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 41 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 61 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms_OH_0) ).
cnf(cls_PropLog_Othms__notE_0,axiom,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,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/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Othms__notE_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left__insert_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_PropLog_Odeduction_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_PropLog_Odeduction_0) ).
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_7,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_8,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,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__notE_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)) ),
c_0_7 ).
cnf(c_0_10,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_11,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_12,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,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_8 ).
cnf(c_0_13,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_9,c_0_10]) ).
cnf(c_0_14,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_11 ).
cnf(c_0_15,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_16,plain,
( ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Odeduction_0]) ).
cnf(c_0_17,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,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_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(X1,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_20,plain,
( ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| c_in(c_PropLog_Opl_Oop_A_N_62(X2,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4)) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
c_in(X1,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,X1,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL439-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.51 % Computer : n006.cluster.edu
% 0.10/5.51 % Model : x86_64 x86_64
% 0.10/5.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.51 % Memory : 8046.5625MB
% 0.10/5.51 % OS : Linux 6.8.0-71-generic
% 0.10/5.51 % CPULimit : 300
% 0.10/5.51 % WCLimit : 300
% 0.10/5.51 % DateTime : Mon Sep 21 00:32:18 UTC 2026
% 0.10/5.51 % CPUTime :
% 0.10/5.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.56 Running first-order theorem proving
% 0.10/5.56 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.10/5.58 % Version: 3.5.1
% 0.10/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.10/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.10/5.58 % Starting sh5l with 300s (1) cores
% 0.10/5.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1634566 completed with status 0
% 0.10/5.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/5.58 % No SInE strategy applied
% 0.10/5.58 % Search class: FHUNF-FFSF32-MFFFFFNN
% 0.10/5.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/5.58 % Starting new_bool_3 with 136s (1) cores
% 0.10/5.58 % Starting new_bool_1 with 136s (1) cores
% 0.10/5.58 % new_bool_3 with pid 1634574 completed with status 0
% 0.10/5.58 % Result found by new_bool_3
% 0.10/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/5.58 % No SInE strategy applied
% 0.10/5.58 % Search class: FHUNF-FFSF32-MFFFFFNN
% 0.10/5.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/5.58 % Starting new_bool_3 with 136s (1) cores
% 0.10/5.58 % Preprocessing time : 0.001 s
% 0.10/5.58 % Presaturation interreduction done
% 0.10/5.58
% 0.10/5.58 % Proof found!
% 0.10/5.58 % SZS status Unsatisfiable
% 0.10/5.58 % SZS output start CNFRefutation
% See solution above
% 0.10/5.58 % Parsed axioms : 7
% 0.10/5.58 % Removed by relevancy pruning/SinE : 0
% 0.10/5.58 % Initial clauses : 7
% 0.10/5.58 % Removed in clause preprocessing : 0
% 0.10/5.58 % Initial clauses in saturation : 7
% 0.10/5.58 % Processed clauses : 35
% 0.10/5.58 % ...of these trivial : 0
% 0.10/5.58 % ...subsumed : 0
% 0.10/5.58 % ...remaining for further processing : 35
% 0.10/5.58 % Other redundant clauses eliminated : 0
% 0.10/5.58 % Clauses deleted for lack of memory : 0
% 0.10/5.58 % Backward-subsumed : 0
% 0.10/5.58 % Backward-rewritten : 2
% 0.10/5.58 % Generated clauses : 68
% 0.10/5.58 % ...of the previous two non-redundant : 57
% 0.10/5.58 % ...aggressively subsumed : 0
% 0.10/5.58 % Contextual simplify-reflections : 0
% 0.10/5.58 % Paramodulations : 68
% 0.10/5.58 % Factorizations : 0
% 0.10/5.58 % NegExts : 0
% 0.10/5.58 % Equation resolutions : 0
% 0.10/5.58 % Disequality decompositions : 0
% 0.10/5.58 % Total rewrite steps : 11
% 0.10/5.58 % ...of those cached : 3
% 0.10/5.58 % Propositional unsat checks : 0
% 0.10/5.58 % Propositional check models : 0
% 0.10/5.58 % Propositional check unsatisfiable : 0
% 0.10/5.58 % Propositional clauses : 0
% 0.10/5.58 % Propositional clauses after purity: 0
% 0.10/5.58 % Propositional unsat core size : 0
% 0.10/5.58 % Propositional preprocessing time : 0.000
% 0.10/5.58 % Propositional encoding time : 0.000
% 0.10/5.58 % Propositional solver time : 0.000
% 0.10/5.58 % Success case prop preproc time : 0.000
% 0.10/5.58 % Success case prop encoding time : 0.000
% 0.10/5.58 % Success case prop solver time : 0.000
% 0.10/5.58 % Current number of processed clauses : 26
% 0.10/5.58 % Positive orientable unit clauses : 17
% 0.10/5.58 % Positive unorientable unit clauses: 0
% 0.10/5.58 % Negative unit clauses : 0
% 0.10/5.58 % Non-unit-clauses : 9
% 0.10/5.58 % Current number of unprocessed clauses: 36
% 0.10/5.58 % ...number of literals in the above : 46
% 0.10/5.58 % Current number of archived formulas : 0
% 0.10/5.58 % Current number of archived clauses : 9
% 0.10/5.58 % Clause-clause subsumption calls (NU) : 20
% 0.10/5.58 % Rec. Clause-clause subsumption calls : 20
% 0.10/5.58 % Non-unit clause-clause subsumptions : 0
% 0.10/5.58 % Unit Clause-clause subsumption calls : 2
% 0.10/5.58 % Rewrite failures with RHS unbound : 0
% 0.10/5.58 % BW rewrite match attempts : 43
% 0.10/5.58 % BW rewrite match successes : 2
% 0.10/5.58 % Condensation attempts : 0
% 0.10/5.58 % Condensation successes : 0
% 0.10/5.58 % Termbank termtop insertions : 1858
% 0.10/5.58 % Search garbage collected termcells : 14
% 0.10/5.58
% 0.10/5.58 % -------------------------------------------------
% 0.10/5.58 % User time : 0.004 s
% 0.10/5.58 % System time : 0.004 s
% 0.10/5.58 % Total time : 0.008 s
% 0.10/5.58 % Maximum resident set size: 3636 pages
% 0.10/5.58
% 0.10/5.58 % -------------------------------------------------
% 0.10/5.58 % User time : 0.024 s
% 0.10/5.58 % System time : 0.015 s
% 0.10/5.58 % Total time : 0.039 s
% 0.10/5.58 % Maximum resident set size: 4608 pages
% 0.10/5.58 % E exiting
%------------------------------------------------------------------------------