%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL434-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 : n011.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:44 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 11 unt; 4 nHn; 16 RR)
% Number of literals : 34 ( 5 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 39 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,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_PropLog_Oweaken__right_0,axiom,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).
cnf(cls_Set_OinsertE_0,axiom,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_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_0,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_PropLog_Othms__I_0,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms__I_0) ).
cnf(c_0_6,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,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_7,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__right_0]) ).
cnf(c_0_8,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
c_0_6 ).
cnf(c_0_10,plain,
( ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X4,X1,X3),c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
c_0_7 ).
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,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_8 ).
cnf(c_0_13,negated_conjecture,
c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
cls_conjecture_0 ).
cnf(c_0_14,negated_conjecture,
~ c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
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(v_pa,v_H,tc_PropLog_Opl(t_a))
| v_p = v_pa ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ c_in(v_pa,v_H,tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
v_p = v_pa,
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(X1,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
cls_PropLog_Othms__I_0 ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL434-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n011.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 00:32:10 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.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/0.55 % Version: 3.5.1
% 0.23/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % Starting sh5l with 300s (1) cores
% 0.23/0.55 % new_bool_3 with pid 577656 completed with status 0
% 0.23/0.55 % Result found by new_bool_3
% 0.23/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % SubtermCWHack with pid 577662 completed with status 0
% 0.23/0.55 % Result found by SubtermCWHack
% 0.23/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.55 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % Preprocessing time : 0.001 s
% 0.23/0.55
% 0.23/0.55 % Proof found!
% 0.23/0.55 % SZS status Unsatisfiable
% 0.23/0.55 % SZS output start CNFRefutation
% See solution above
% 0.23/0.55 % Parsed axioms : 6
% 0.23/0.55 % Removed by relevancy pruning/SinE : 0
% 0.23/0.55 % Initial clauses : 6
% 0.23/0.55 % Removed in clause preprocessing : 0
% 0.23/0.55 % Initial clauses in saturation : 6
% 0.23/0.55 % Processed clauses : 11
% 0.23/0.55 % ...of these trivial : 0
% 0.23/0.55 % ...subsumed : 0
% 0.23/0.55 % ...remaining for further processing : 11
% 0.23/0.55 % Other redundant clauses eliminated : 0
% 0.23/0.55 % Clauses deleted for lack of memory : 0
% 0.23/0.55 % Backward-subsumed : 0
% 0.23/0.55 % Backward-rewritten : 0
% 0.23/0.55 % Generated clauses : 8
% 0.23/0.55 % ...of the previous two non-redundant : 6
% 0.23/0.55 % ...aggressively subsumed : 0
% 0.23/0.55 % Contextual simplify-reflections : 0
% 0.23/0.55 % Paramodulations : 7
% 0.23/0.55 % Factorizations : 0
% 0.23/0.55 % NegExts : 0
% 0.23/0.55 % Equation resolutions : 0
% 0.23/0.55 % Disequality decompositions : 0
% 0.23/0.55 % Total rewrite steps : 1
% 0.23/0.55 % ...of those cached : 0
% 0.23/0.55 % Propositional unsat checks : 0
% 0.23/0.55 % Propositional check models : 0
% 0.23/0.55 % Propositional check unsatisfiable : 0
% 0.23/0.55 % Propositional clauses : 0
% 0.23/0.55 % Propositional clauses after purity: 0
% 0.23/0.55 % Propositional unsat core size : 0
% 0.23/0.55 % Propositional preprocessing time : 0.000
% 0.23/0.55 % Propositional encoding time : 0.000
% 0.23/0.55 % Propositional solver time : 0.000
% 0.23/0.55 % Success case prop preproc time : 0.000
% 0.23/0.55 % Success case prop encoding time : 0.000
% 0.23/0.55 % Success case prop solver time : 0.000
% 0.23/0.55 % Current number of processed clauses : 10
% 0.23/0.55 % Positive orientable unit clauses : 3
% 0.23/0.55 % Positive unorientable unit clauses: 0
% 0.23/0.55 % Negative unit clauses : 4
% 0.23/0.55 % Non-unit-clauses : 3
% 0.23/0.55 % Current number of unprocessed clauses: 0
% 0.23/0.55 % ...number of literals in the above : 0
% 0.23/0.55 % Current number of archived formulas : 0
% 0.23/0.55 % Current number of archived clauses : 1
% 0.23/0.55 % Clause-clause subsumption calls (NU) : 1
% 0.23/0.55 % Rec. Clause-clause subsumption calls : 1
% 0.23/0.55 % Non-unit clause-clause subsumptions : 0
% 0.23/0.55 % Unit Clause-clause subsumption calls : 5
% 0.23/0.55 % Rewrite failures with RHS unbound : 0
% 0.23/0.55 % BW rewrite match attempts : 0
% 0.23/0.55 % BW rewrite match successes : 0
% 0.23/0.55 % Condensation attempts : 0
% 0.23/0.55 % Condensation successes : 0
% 0.23/0.55 % Termbank termtop insertions : 237
% 0.23/0.55 % Search garbage collected termcells : 10
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.002 s
% 0.23/0.55 % System time : 0.003 s
% 0.23/0.55 % Total time : 0.005 s
% 0.23/0.55 % Maximum resident set size: 3632 pages
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.005 s
% 0.23/0.55 % System time : 0.008 s
% 0.23/0.55 % Total time : 0.013 s
% 0.23/0.55 % Maximum resident set size: 4608 pages
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------