%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN004-1.007 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 03:21:43 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 17 unt; 0 nHn; 56 RR)
% Number of literals : 131 ( 0 equ; 79 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 15 ( 14 usr; 15 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(pqp_1,negated_conjecture,
( ~ q_1
| ~ p_1
| p_2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_1) ).
cnf(pqq_1,negated_conjecture,
( ~ q_1
| ~ p_1
| q_2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqq_1) ).
cnf(pqp_2,negated_conjecture,
( ~ q_2
| ~ p_2
| p_3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_2) ).
cnf(base_1,negated_conjecture,
p_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_1) ).
cnf(base_2,negated_conjecture,
q_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_2) ).
cnf(pqq_2,negated_conjecture,
( ~ q_2
| ~ p_2
| q_3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqq_2) ).
cnf(pqp_3,negated_conjecture,
( ~ q_3
| ~ p_3
| p_4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_3) ).
cnf(pqq_3,negated_conjecture,
( ~ q_3
| ~ p_3
| q_4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqq_3) ).
cnf(pqp_4,negated_conjecture,
( ~ q_4
| ~ p_4
| p_5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_4) ).
cnf(pqq_4,negated_conjecture,
( ~ q_4
| ~ p_4
| q_5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqq_4) ).
cnf(pqp_5,negated_conjecture,
( ~ q_5
| ~ p_5
| p_6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_5) ).
cnf(pqq_5,negated_conjecture,
( ~ q_5
| ~ p_5
| q_6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqq_5) ).
cnf(pqp_6,negated_conjecture,
( ~ q_6
| ~ p_6
| p_7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_6) ).
cnf(base_3,negated_conjecture,
( ~ q_7
| ~ p_7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_3) ).
cnf(pqq_6,negated_conjecture,
( ~ q_6
| ~ p_6
| q_7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqq_6) ).
cnf(c_0_15,negated_conjecture,
( ~ q_1
| ~ p_1
| p_2 ),
inference(fof_simplification,[status(thm)],[pqp_1]) ).
cnf(c_0_16,negated_conjecture,
( ~ q_1
| ~ p_1
| q_2 ),
inference(fof_simplification,[status(thm)],[pqq_1]) ).
cnf(c_0_17,negated_conjecture,
( ~ q_2
| ~ p_2
| p_3 ),
inference(fof_simplification,[status(thm)],[pqp_2]) ).
cnf(c_0_18,negated_conjecture,
( ~ q_1
| ~ p_1
| p_2 ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
p_1,
base_1 ).
cnf(c_0_20,negated_conjecture,
q_1,
base_2 ).
cnf(c_0_21,negated_conjecture,
( ~ q_1
| ~ p_1
| q_2 ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( ~ q_2
| ~ p_2
| q_3 ),
inference(fof_simplification,[status(thm)],[pqq_2]) ).
cnf(c_0_23,negated_conjecture,
( ~ q_3
| ~ p_3
| p_4 ),
inference(fof_simplification,[status(thm)],[pqp_3]) ).
cnf(c_0_24,negated_conjecture,
( ~ q_2
| ~ p_2
| p_3 ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
p_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
q_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
( ~ q_2
| ~ p_2
| q_3 ),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
( ~ q_3
| ~ p_3
| q_4 ),
inference(fof_simplification,[status(thm)],[pqq_3]) ).
cnf(c_0_29,negated_conjecture,
( ~ q_4
| ~ p_4
| p_5 ),
inference(fof_simplification,[status(thm)],[pqp_4]) ).
cnf(c_0_30,negated_conjecture,
( ~ q_3
| ~ p_3
| p_4 ),
c_0_23 ).
cnf(c_0_31,negated_conjecture,
p_3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
q_3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_25]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
( ~ q_3
| ~ p_3
| q_4 ),
c_0_28 ).
cnf(c_0_34,negated_conjecture,
( ~ q_4
| ~ p_4
| q_5 ),
inference(fof_simplification,[status(thm)],[pqq_4]) ).
cnf(c_0_35,negated_conjecture,
( ~ q_5
| ~ p_5
| p_6 ),
inference(fof_simplification,[status(thm)],[pqp_5]) ).
cnf(c_0_36,negated_conjecture,
( ~ q_4
| ~ p_4
| p_5 ),
c_0_29 ).
cnf(c_0_37,negated_conjecture,
p_4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
q_4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_31]),c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
( ~ q_4
| ~ p_4
| q_5 ),
c_0_34 ).
cnf(c_0_40,negated_conjecture,
( ~ q_5
| ~ p_5
| q_6 ),
inference(fof_simplification,[status(thm)],[pqq_5]) ).
cnf(c_0_41,negated_conjecture,
( ~ q_6
| ~ p_6
| p_7 ),
inference(fof_simplification,[status(thm)],[pqp_6]) ).
cnf(c_0_42,negated_conjecture,
( ~ q_5
| ~ p_5
| p_6 ),
c_0_35 ).
cnf(c_0_43,negated_conjecture,
p_5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
q_5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_37]),c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
( ~ q_5
| ~ p_5
| q_6 ),
c_0_40 ).
cnf(c_0_46,negated_conjecture,
( ~ q_7
| ~ p_7 ),
inference(fof_simplification,[status(thm)],[base_3]) ).
cnf(c_0_47,negated_conjecture,
( ~ q_6
| ~ p_6
| p_7 ),
c_0_41 ).
cnf(c_0_48,negated_conjecture,
p_6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
q_6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_43]),c_0_44])]) ).
cnf(c_0_50,negated_conjecture,
( ~ q_6
| ~ p_6
| q_7 ),
inference(fof_simplification,[status(thm)],[pqq_6]) ).
cnf(c_0_51,negated_conjecture,
( ~ q_7
| ~ p_7 ),
c_0_46 ).
cnf(c_0_52,negated_conjecture,
p_7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_53,negated_conjecture,
( ~ q_6
| ~ p_6
| q_7 ),
c_0_50 ).
cnf(c_0_54,negated_conjecture,
~ q_7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_48]),c_0_49])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN004-1.007 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.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 10:43:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_1 with pid 2227841 completed with status 0
% 0.14/0.43 % Result found by new_bool_1
% 0.14/0.43 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FHHNF-FFSF00-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 2227843 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FHHNF-FFSF00-SFFFFFNN
% 0.14/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 15
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 15
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 15
% 0.14/0.43 % Processed clauses : 16
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 15
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 1
% 0.14/0.43 % Generated clauses : 0
% 0.14/0.43 % ...of the previous two non-redundant : 1
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 0
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 25
% 0.14/0.43 % ...of those cached : 12
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 14
% 0.14/0.43 % Positive orientable unit clauses : 13
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 1
% 0.14/0.43 % Non-unit-clauses : 0
% 0.14/0.43 % Current number of unprocessed clauses: 0
% 0.14/0.43 % ...number of literals in the above : 0
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 1
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.43 % Non-unit clause-clause subsumptions : 0
% 0.14/0.43 % Unit Clause-clause subsumption calls : 0
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 1
% 0.14/0.43 % BW rewrite match successes : 1
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 405
% 0.14/0.43 % Search garbage collected termcells : 39
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.000 s
% 0.14/0.43 % System time : 0.004 s
% 0.14/0.43 % Total time : 0.004 s
% 0.14/0.43 % Maximum resident set size: 3632 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.002 s
% 0.14/0.43 % System time : 0.008 s
% 0.14/0.43 % Total time : 0.010 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------