%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL438-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:45 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 24 ( 0 equ; 12 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 : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 32 ( 2 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_OS_0,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OS_0) ).
cnf(cls_conjecture_4,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/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),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_3,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_3) ).
cnf(c_0_5,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_6,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_5 ).
cnf(c_0_7,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X3,X4),X4),c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X4),c_PropLog_Opl_Oop_A_N_62(X1,X3,X4),X4),X4),c_PropLog_Othms(X5,X4),tc_PropLog_Opl(X4)),
cls_PropLog_Othms_OS_0 ).
cnf(c_0_8,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X2,X4,X3),X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Opl_Oop_A_N_62(X1,X4,X3),X3),c_PropLog_Othms(X5,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,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_4]) ).
cnf(c_0_10,plain,
( ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,X5,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Oop_A_N_62(X5,X2,X3),X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| c_in(c_PropLog_Opl_Oop_A_N_62(X1,X2,X3),c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,v_q,t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_1 ).
cnf(c_0_12,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)),
cls_conjecture_3 ).
cnf(c_0_13,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_9 ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL438-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.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:26 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.10/0.42 % Version: 3.5.1
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.42 % Starting sh5l with 300s (1) cores
% 0.10/0.42 % new_bool_3 with pid 578404 completed with status 0
% 0.10/0.42 % Result found by new_bool_3
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.42 % Search class: FHUNF-FFSF32-MFFFFFNN
% 0.10/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.42 % SubtermCWHack with pid 578409 completed with status 0
% 0.10/0.42 % Result found by SubtermCWHack
% 0.10/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.42 % Search class: FHUNF-FFSF32-MFFFFFNN
% 0.10/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.42 % Preprocessing time : 0.001 s
% 0.10/0.42
% 0.10/0.42 % Proof found!
% 0.10/0.42 % SZS status Unsatisfiable
% 0.10/0.42 % SZS output start CNFRefutation
% See solution above
% 0.10/0.42 % Parsed axioms : 5
% 0.10/0.42 % Removed by relevancy pruning/SinE : 0
% 0.10/0.42 % Initial clauses : 5
% 0.10/0.42 % Removed in clause preprocessing : 0
% 0.10/0.42 % Initial clauses in saturation : 5
% 0.10/0.42 % Processed clauses : 10
% 0.10/0.42 % ...of these trivial : 0
% 0.10/0.42 % ...subsumed : 0
% 0.10/0.42 % ...remaining for further processing : 10
% 0.10/0.42 % Other redundant clauses eliminated : 0
% 0.10/0.42 % Clauses deleted for lack of memory : 0
% 0.10/0.42 % Backward-subsumed : 0
% 0.10/0.42 % Backward-rewritten : 0
% 0.10/0.42 % Generated clauses : 8
% 0.10/0.42 % ...of the previous two non-redundant : 7
% 0.10/0.42 % ...aggressively subsumed : 0
% 0.10/0.42 % Contextual simplify-reflections : 1
% 0.10/0.42 % Paramodulations : 8
% 0.10/0.42 % Factorizations : 0
% 0.10/0.42 % NegExts : 0
% 0.10/0.42 % Equation resolutions : 0
% 0.10/0.42 % Disequality decompositions : 0
% 0.10/0.42 % Total rewrite steps : 1
% 0.10/0.42 % ...of those cached : 0
% 0.10/0.42 % Propositional unsat checks : 0
% 0.10/0.42 % Propositional check models : 0
% 0.10/0.42 % Propositional check unsatisfiable : 0
% 0.10/0.42 % Propositional clauses : 0
% 0.10/0.42 % Propositional clauses after purity: 0
% 0.10/0.42 % Propositional unsat core size : 0
% 0.10/0.42 % Propositional preprocessing time : 0.000
% 0.10/0.42 % Propositional encoding time : 0.000
% 0.10/0.42 % Propositional solver time : 0.000
% 0.10/0.42 % Success case prop preproc time : 0.000
% 0.10/0.42 % Success case prop encoding time : 0.000
% 0.10/0.42 % Success case prop solver time : 0.000
% 0.10/0.42 % Current number of processed clauses : 10
% 0.10/0.42 % Positive orientable unit clauses : 3
% 0.10/0.42 % Positive unorientable unit clauses: 0
% 0.10/0.42 % Negative unit clauses : 1
% 0.10/0.42 % Non-unit-clauses : 6
% 0.10/0.42 % Current number of unprocessed clauses: 0
% 0.10/0.42 % ...number of literals in the above : 0
% 0.10/0.42 % Current number of archived formulas : 0
% 0.10/0.42 % Current number of archived clauses : 0
% 0.10/0.42 % Clause-clause subsumption calls (NU) : 5
% 0.10/0.42 % Rec. Clause-clause subsumption calls : 5
% 0.10/0.42 % Non-unit clause-clause subsumptions : 1
% 0.10/0.42 % Unit Clause-clause subsumption calls : 0
% 0.10/0.42 % Rewrite failures with RHS unbound : 0
% 0.10/0.42 % BW rewrite match attempts : 0
% 0.10/0.42 % BW rewrite match successes : 0
% 0.10/0.42 % Condensation attempts : 0
% 0.10/0.42 % Condensation successes : 0
% 0.10/0.42 % Termbank termtop insertions : 391
% 0.10/0.42 % Search garbage collected termcells : 8
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.003 s
% 0.10/0.42 % System time : 0.001 s
% 0.10/0.42 % Total time : 0.004 s
% 0.10/0.42 % Maximum resident set size: 3636 pages
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.003 s
% 0.10/0.42 % System time : 0.005 s
% 0.10/0.42 % Total time : 0.008 s
% 0.10/0.42 % Maximum resident set size: 4864 pages
% 0.10/0.42 % E exiting
%------------------------------------------------------------------------------