%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL439-1 : 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 : n003.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.28s 0.48s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 44 ( 0 equ; 24 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 : 63 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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_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/Axioms/LCL005-0.ax',cls_PropLog_Othms_OH_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(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_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_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
cnf(c_0_7,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_8,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_9,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_7 ).
cnf(c_0_10,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_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)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms_OH_0]) ).
cnf(c_0_12,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_13,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_14,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,c_PropLog_Opl_Ofalse,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_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_11 ).
cnf(c_0_16,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_12 ).
cnf(c_0_17,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_13 ).
cnf(c_0_18,plain,
( ~ c_in(X5,c_insert(X2,X3,tc_PropLog_Opl(X4)),tc_PropLog_Opl(X4))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X5,c_PropLog_Opl_Ofalse,X4),c_PropLog_Othms(X3,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_14,c_0_15]) ).
cnf(c_0_19,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_20,negated_conjecture,
~ c_in(v_q,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_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ c_in(v_p,c_insert(X2,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
| c_in(X1,c_PropLog_Othms(c_insert(X2,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL439-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 00:34:02 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.28/0.48 % Version: 3.5.1
% 0.28/0.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.28/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.48 % Starting sh5l with 300s (1) cores
% 0.28/0.48 % new_bool_3 with pid 3016142 completed with status 0
% 0.28/0.48 % Result found by new_bool_3
% 0.28/0.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.28/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.48 % Search class: FGHSM-FFMF32-MFFFFFNN
% 0.28/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.48 % SubtermCWHack with pid 3016145 completed with status 0
% 0.28/0.48 % Result found by SubtermCWHack
% 0.28/0.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.28/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.48 % Search class: FGHSM-FFMF32-MFFFFFNN
% 0.28/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.48 % Preprocessing time : 0.002 s
% 0.28/0.48
% 0.28/0.48 % Proof found!
% 0.28/0.48 % SZS status Unsatisfiable
% 0.28/0.48 % SZS output start CNFRefutation
% See solution above
% 0.28/0.48 % Parsed axioms : 1372
% 0.28/0.48 % Removed by relevancy pruning/SinE : 1330
% 0.28/0.48 % Initial clauses : 42
% 0.28/0.48 % Removed in clause preprocessing : 0
% 0.28/0.48 % Initial clauses in saturation : 42
% 0.28/0.48 % Processed clauses : 232
% 0.28/0.48 % ...of these trivial : 5
% 0.28/0.48 % ...subsumed : 122
% 0.28/0.48 % ...remaining for further processing : 105
% 0.28/0.48 % Other redundant clauses eliminated : 0
% 0.28/0.48 % Clauses deleted for lack of memory : 0
% 0.28/0.48 % Backward-subsumed : 12
% 0.28/0.48 % Backward-rewritten : 2
% 0.28/0.48 % Generated clauses : 474
% 0.28/0.48 % ...of the previous two non-redundant : 438
% 0.28/0.48 % ...aggressively subsumed : 0
% 0.28/0.48 % Contextual simplify-reflections : 2
% 0.28/0.48 % Paramodulations : 467
% 0.28/0.48 % Factorizations : 0
% 0.28/0.48 % NegExts : 0
% 0.28/0.48 % Equation resolutions : 7
% 0.28/0.48 % Disequality decompositions : 0
% 0.28/0.48 % Total rewrite steps : 10
% 0.28/0.48 % ...of those cached : 4
% 0.28/0.48 % Propositional unsat checks : 0
% 0.28/0.48 % Propositional check models : 0
% 0.28/0.48 % Propositional check unsatisfiable : 0
% 0.28/0.48 % Propositional clauses : 0
% 0.28/0.48 % Propositional clauses after purity: 0
% 0.28/0.48 % Propositional unsat core size : 0
% 0.28/0.48 % Propositional preprocessing time : 0.000
% 0.28/0.48 % Propositional encoding time : 0.000
% 0.28/0.48 % Propositional solver time : 0.000
% 0.28/0.48 % Success case prop preproc time : 0.000
% 0.28/0.48 % Success case prop encoding time : 0.000
% 0.28/0.48 % Success case prop solver time : 0.000
% 0.28/0.48 % Current number of processed clauses : 91
% 0.28/0.48 % Positive orientable unit clauses : 7
% 0.28/0.48 % Positive unorientable unit clauses: 0
% 0.28/0.48 % Negative unit clauses : 15
% 0.28/0.48 % Non-unit-clauses : 69
% 0.28/0.48 % Current number of unprocessed clauses: 217
% 0.28/0.48 % ...number of literals in the above : 669
% 0.28/0.48 % Current number of archived formulas : 0
% 0.28/0.48 % Current number of archived clauses : 14
% 0.28/0.48 % Clause-clause subsumption calls (NU) : 1464
% 0.28/0.48 % Rec. Clause-clause subsumption calls : 1395
% 0.28/0.48 % Non-unit clause-clause subsumptions : 116
% 0.28/0.48 % Unit Clause-clause subsumption calls : 24
% 0.28/0.48 % Rewrite failures with RHS unbound : 0
% 0.28/0.48 % BW rewrite match attempts : 4
% 0.28/0.48 % BW rewrite match successes : 2
% 0.28/0.48 % Condensation attempts : 0
% 0.28/0.48 % Condensation successes : 0
% 0.28/0.48 % Termbank termtop insertions : 18572
% 0.28/0.48 % Search garbage collected termcells : 2664
% 0.28/0.48
% 0.28/0.48 % -------------------------------------------------
% 0.28/0.48 % User time : 0.012 s
% 0.28/0.48 % System time : 0.004 s
% 0.28/0.48 % Total time : 0.016 s
% 0.28/0.48 % Maximum resident set size: 4612 pages
% 0.28/0.48
% 0.28/0.48 % -------------------------------------------------
% 0.28/0.48 % User time : 0.031 s
% 0.28/0.48 % System time : 0.010 s
% 0.28/0.48 % Total time : 0.041 s
% 0.28/0.48 % Maximum resident set size: 5376 pages
% 0.28/0.48 % E exiting
%------------------------------------------------------------------------------