%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL443-1 : 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 : n013.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:47 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 11 unt; 0 nHn; 22 RR)
% Number of literals : 51 ( 0 equ; 27 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 : 73 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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/Axioms/LCL005-0.ax',cls_PropLog_Othms_OH_0) ).
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_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
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/sandbox/benchmark/theBenchmark.p',cls_PropLog_Odeduction_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_8,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_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,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_8 ).
cnf(c_0_11,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_12,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_13,plain,
( ~ c_in(X4,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_15,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
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(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_12 ).
cnf(c_0_18,plain,
( ~ c_in(X2,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
c_0_15 ).
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,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,X1,X4),c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X5,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_10,c_0_17]) ).
cnf(c_0_22,plain,
( ~ c_in(X2,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X1,X3),X4,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
~ c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ c_in(X2,c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X3,X1,X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4))
| c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X5,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_1 ).
cnf(c_0_26,negated_conjecture,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL443-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 00:32:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.20/0.52 % Version: 3.5.1
% 0.20/0.52 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.20/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 % Starting sh5l with 300s (1) cores
% 0.20/0.52 % new_bool_3 with pid 3780136 completed with status 0
% 0.20/0.52 % Result found by new_bool_3
% 0.20/0.52 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.20/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.20/0.52 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.52 % SubtermCWHack with pid 3780139 completed with status 0
% 0.20/0.52 % Result found by SubtermCWHack
% 0.20/0.52 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.20/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.52 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.20/0.52 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.52 % Preprocessing time : 0.004 s
% 0.20/0.52
% 0.20/0.52 % Proof found!
% 0.20/0.52 % SZS status Unsatisfiable
% 0.20/0.52 % SZS output start CNFRefutation
% See solution above
% 0.20/0.52 % Parsed axioms : 1373
% 0.20/0.52 % Removed by relevancy pruning/SinE : 1330
% 0.20/0.52 % Initial clauses : 43
% 0.20/0.52 % Removed in clause preprocessing : 0
% 0.20/0.52 % Initial clauses in saturation : 43
% 0.20/0.52 % Processed clauses : 352
% 0.20/0.52 % ...of these trivial : 6
% 0.20/0.52 % ...subsumed : 182
% 0.20/0.52 % ...remaining for further processing : 164
% 0.20/0.52 % Other redundant clauses eliminated : 0
% 0.20/0.52 % Clauses deleted for lack of memory : 0
% 0.20/0.52 % Backward-subsumed : 10
% 0.20/0.52 % Backward-rewritten : 4
% 0.20/0.52 % Generated clauses : 1589
% 0.20/0.52 % ...of the previous two non-redundant : 1523
% 0.20/0.52 % ...aggressively subsumed : 0
% 0.20/0.52 % Contextual simplify-reflections : 0
% 0.20/0.52 % Paramodulations : 1582
% 0.20/0.52 % Factorizations : 0
% 0.20/0.52 % NegExts : 0
% 0.20/0.52 % Equation resolutions : 7
% 0.20/0.52 % Disequality decompositions : 0
% 0.20/0.52 % Total rewrite steps : 35
% 0.20/0.52 % ...of those cached : 15
% 0.20/0.52 % Propositional unsat checks : 0
% 0.20/0.52 % Propositional check models : 0
% 0.20/0.52 % Propositional check unsatisfiable : 0
% 0.20/0.52 % Propositional clauses : 0
% 0.20/0.52 % Propositional clauses after purity: 0
% 0.20/0.52 % Propositional unsat core size : 0
% 0.20/0.52 % Propositional preprocessing time : 0.000
% 0.20/0.52 % Propositional encoding time : 0.000
% 0.20/0.52 % Propositional solver time : 0.000
% 0.20/0.52 % Success case prop preproc time : 0.000
% 0.20/0.52 % Success case prop encoding time : 0.000
% 0.20/0.52 % Success case prop solver time : 0.000
% 0.20/0.52 % Current number of processed clauses : 150
% 0.20/0.52 % Positive orientable unit clauses : 13
% 0.20/0.52 % Positive unorientable unit clauses: 0
% 0.20/0.52 % Negative unit clauses : 14
% 0.20/0.52 % Non-unit-clauses : 123
% 0.20/0.52 % Current number of unprocessed clauses: 1181
% 0.20/0.52 % ...number of literals in the above : 3266
% 0.20/0.52 % Current number of archived formulas : 0
% 0.20/0.52 % Current number of archived clauses : 14
% 0.20/0.52 % Clause-clause subsumption calls (NU) : 3246
% 0.20/0.52 % Rec. Clause-clause subsumption calls : 3193
% 0.20/0.52 % Non-unit clause-clause subsumptions : 162
% 0.20/0.52 % Unit Clause-clause subsumption calls : 48
% 0.20/0.52 % Rewrite failures with RHS unbound : 0
% 0.20/0.52 % BW rewrite match attempts : 87
% 0.20/0.52 % BW rewrite match successes : 4
% 0.20/0.52 % Condensation attempts : 0
% 0.20/0.52 % Condensation successes : 0
% 0.20/0.52 % Termbank termtop insertions : 45579
% 0.20/0.52 % Search garbage collected termcells : 2664
% 0.20/0.52
% 0.20/0.52 % -------------------------------------------------
% 0.20/0.52 % User time : 0.059 s
% 0.20/0.52 % System time : 0.007 s
% 0.20/0.52 % Total time : 0.066 s
% 0.20/0.52 % Maximum resident set size: 4616 pages
% 0.20/0.52
% 0.20/0.52 % -------------------------------------------------
% 0.20/0.52 % User time : 0.083 s
% 0.20/0.52 % System time : 0.015 s
% 0.20/0.52 % Total time : 0.098 s
% 0.20/0.52 % Maximum resident set size: 5632 pages
% 0.20/0.52 % E exiting
%------------------------------------------------------------------------------