%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL441-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 : n020.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.15s 5.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 14 ( 5 unt; 0 nHn; 12 RR)
% Number of literals : 23 ( 0 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 15 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(v_a,v_tt,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
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(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_in(v_a,v_tt,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
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_4,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(v_a,v_tt,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_5,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_6,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_in(v_a,v_tt,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_7,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(v_a,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(v_a,v_tt,t_a) ),
c_0_4 ).
cnf(c_0_8,plain,
( ~ c_in(X1,X2,tc_PropLog_Opl(X3))
| c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_5 ).
cnf(c_0_9,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
| c_in(v_a,v_tt,t_a) ),
c_0_6 ).
cnf(c_0_11,negated_conjecture,
~ c_in(v_a,v_tt,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_a,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL441-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.39 % Computer : n020.cluster.edu
% 0.09/5.39 % Model : x86_64 x86_64
% 0.09/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.39 % Memory : 8046.5625MB
% 0.09/5.39 % OS : Linux 6.8.0-71-generic
% 0.09/5.39 % CPULimit : 300
% 0.09/5.39 % WCLimit : 300
% 0.09/5.39 % DateTime : Mon Sep 21 00:33:25 UTC 2026
% 0.09/5.39 % CPUTime :
% 0.09/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 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.15/5.48 % Version: 3.5.1
% 0.15/5.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/5.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.48 % Starting sh5l with 300s (1) cores
% 0.15/5.48 % new_bool_1 with pid 1607389 completed with status 0
% 0.15/5.48 % Result found by new_bool_1
% 0.15/5.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/5.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.48 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.15/5.48 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.48 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.48 % SubtermCWHack with pid 1607392 completed with status 0
% 0.15/5.48 % Result found by SubtermCWHack
% 0.15/5.48 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/5.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.48 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.15/5.48 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.48 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.48 % Preprocessing time : 0.002 s
% 0.15/5.48
% 0.15/5.48 % Proof found!
% 0.15/5.48 % SZS status Unsatisfiable
% 0.15/5.48 % SZS output start CNFRefutation
% See solution above
% 0.15/5.48 % Parsed axioms : 1377
% 0.15/5.48 % Removed by relevancy pruning/SinE : 1296
% 0.15/5.48 % Initial clauses : 81
% 0.15/5.48 % Removed in clause preprocessing : 1
% 0.15/5.48 % Initial clauses in saturation : 80
% 0.15/5.48 % Processed clauses : 99
% 0.15/5.48 % ...of these trivial : 3
% 0.15/5.48 % ...subsumed : 14
% 0.15/5.48 % ...remaining for further processing : 82
% 0.15/5.48 % Other redundant clauses eliminated : 0
% 0.15/5.48 % Clauses deleted for lack of memory : 0
% 0.15/5.48 % Backward-subsumed : 3
% 0.15/5.48 % Backward-rewritten : 2
% 0.15/5.48 % Generated clauses : 60
% 0.15/5.48 % ...of the previous two non-redundant : 27
% 0.15/5.48 % ...aggressively subsumed : 0
% 0.15/5.48 % Contextual simplify-reflections : 0
% 0.15/5.48 % Paramodulations : 54
% 0.15/5.48 % Factorizations : 0
% 0.15/5.48 % NegExts : 0
% 0.15/5.48 % Equation resolutions : 6
% 0.15/5.48 % Disequality decompositions : 0
% 0.15/5.48 % Total rewrite steps : 17
% 0.15/5.48 % ...of those cached : 6
% 0.15/5.48 % Propositional unsat checks : 0
% 0.15/5.48 % Propositional check models : 0
% 0.15/5.48 % Propositional check unsatisfiable : 0
% 0.15/5.48 % Propositional clauses : 0
% 0.15/5.48 % Propositional clauses after purity: 0
% 0.15/5.48 % Propositional unsat core size : 0
% 0.15/5.48 % Propositional preprocessing time : 0.000
% 0.15/5.48 % Propositional encoding time : 0.000
% 0.15/5.48 % Propositional solver time : 0.000
% 0.15/5.48 % Success case prop preproc time : 0.000
% 0.15/5.48 % Success case prop encoding time : 0.000
% 0.15/5.48 % Success case prop solver time : 0.000
% 0.15/5.48 % Current number of processed clauses : 77
% 0.15/5.48 % Positive orientable unit clauses : 12
% 0.15/5.48 % Positive unorientable unit clauses: 0
% 0.15/5.48 % Negative unit clauses : 9
% 0.15/5.48 % Non-unit-clauses : 56
% 0.15/5.48 % Current number of unprocessed clauses: 8
% 0.15/5.48 % ...number of literals in the above : 21
% 0.15/5.48 % Current number of archived formulas : 0
% 0.15/5.48 % Current number of archived clauses : 5
% 0.15/5.48 % Clause-clause subsumption calls (NU) : 760
% 0.15/5.48 % Rec. Clause-clause subsumption calls : 756
% 0.15/5.48 % Non-unit clause-clause subsumptions : 10
% 0.15/5.48 % Unit Clause-clause subsumption calls : 4
% 0.15/5.48 % Rewrite failures with RHS unbound : 0
% 0.15/5.48 % BW rewrite match attempts : 4
% 0.15/5.48 % BW rewrite match successes : 2
% 0.15/5.48 % Condensation attempts : 0
% 0.15/5.48 % Condensation successes : 0
% 0.15/5.48 % Termbank termtop insertions : 10180
% 0.15/5.48 % Search garbage collected termcells : 2625
% 0.15/5.48
% 0.15/5.48 % -------------------------------------------------
% 0.15/5.48 % User time : 0.008 s
% 0.15/5.48 % System time : 0.003 s
% 0.15/5.48 % Total time : 0.011 s
% 0.15/5.48 % Maximum resident set size: 4876 pages
% 0.15/5.48
% 0.15/5.48 % -------------------------------------------------
% 0.15/5.48 % User time : 0.028 s
% 0.15/5.48 % System time : 0.009 s
% 0.15/5.48 % Total time : 0.037 s
% 0.15/5.48 % Maximum resident set size: 5632 pages
% 0.15/5.48 % E exiting
%------------------------------------------------------------------------------