%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN003-1.006 : 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 : n014.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:31:07 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 17 unt; 0 nHn; 47 RR)
% Number of literals : 92 ( 0 equ; 48 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 13 ( 12 usr; 13 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(qq_1,negated_conjecture,
( ~ q
| q_1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qq_1) ).
cnf(pqp_1,negated_conjecture,
( ~ q_1
| ~ p_1
| p_2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_1) ).
cnf(base_3,negated_conjecture,
q,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_3) ).
cnf(qq_2,negated_conjecture,
( ~ q
| q_2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qq_2) ).
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(qq_3,negated_conjecture,
( ~ q
| q_3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qq_3) ).
cnf(pqp_3,negated_conjecture,
( ~ q_3
| ~ p_3
| p_4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_3) ).
cnf(qq_4,negated_conjecture,
( ~ q
| q_4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qq_4) ).
cnf(pqp_4,negated_conjecture,
( ~ q_4
| ~ p_4
| p_5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_4) ).
cnf(qq_5,negated_conjecture,
( ~ q
| q_5 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qq_5) ).
cnf(pqp_5,negated_conjecture,
( ~ q_5
| ~ p_5
| p_6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pqp_5) ).
cnf(base_2,negated_conjecture,
~ p_6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_2) ).
cnf(c_0_13,negated_conjecture,
( ~ q
| q_1 ),
inference(fof_simplification,[status(thm)],[qq_1]) ).
cnf(c_0_14,negated_conjecture,
( ~ q_1
| ~ p_1
| p_2 ),
inference(fof_simplification,[status(thm)],[pqp_1]) ).
cnf(c_0_15,negated_conjecture,
( ~ q
| q_1 ),
c_0_13 ).
cnf(c_0_16,negated_conjecture,
q,
base_3 ).
cnf(c_0_17,negated_conjecture,
( ~ q
| q_2 ),
inference(fof_simplification,[status(thm)],[qq_2]) ).
cnf(c_0_18,negated_conjecture,
( ~ q_2
| ~ p_2
| p_3 ),
inference(fof_simplification,[status(thm)],[pqp_2]) ).
cnf(c_0_19,negated_conjecture,
( ~ q_1
| ~ p_1
| p_2 ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
p_1,
base_1 ).
cnf(c_0_21,negated_conjecture,
q_1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
( ~ q
| q_2 ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
( ~ q
| q_3 ),
inference(fof_simplification,[status(thm)],[qq_3]) ).
cnf(c_0_24,negated_conjecture,
( ~ q_3
| ~ p_3
| p_4 ),
inference(fof_simplification,[status(thm)],[pqp_3]) ).
cnf(c_0_25,negated_conjecture,
( ~ q_2
| ~ p_2
| p_3 ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
p_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
q_2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_16])]) ).
cnf(c_0_28,negated_conjecture,
( ~ q
| q_3 ),
c_0_23 ).
cnf(c_0_29,negated_conjecture,
( ~ q
| q_4 ),
inference(fof_simplification,[status(thm)],[qq_4]) ).
cnf(c_0_30,negated_conjecture,
( ~ q_4
| ~ p_4
| p_5 ),
inference(fof_simplification,[status(thm)],[pqp_4]) ).
cnf(c_0_31,negated_conjecture,
( ~ q_3
| ~ p_3
| p_4 ),
c_0_24 ).
cnf(c_0_32,negated_conjecture,
p_3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
q_3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_16])]) ).
cnf(c_0_34,negated_conjecture,
( ~ q
| q_4 ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
( ~ q
| q_5 ),
inference(fof_simplification,[status(thm)],[qq_5]) ).
cnf(c_0_36,negated_conjecture,
( ~ q_5
| ~ p_5
| p_6 ),
inference(fof_simplification,[status(thm)],[pqp_5]) ).
cnf(c_0_37,negated_conjecture,
( ~ q_4
| ~ p_4
| p_5 ),
c_0_30 ).
cnf(c_0_38,negated_conjecture,
p_4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
q_4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_16])]) ).
cnf(c_0_40,negated_conjecture,
( ~ q
| q_5 ),
c_0_35 ).
cnf(c_0_41,negated_conjecture,
~ p_6,
inference(fof_simplification,[status(thm)],[base_2]) ).
cnf(c_0_42,negated_conjecture,
( ~ q_5
| ~ p_5
| p_6 ),
c_0_36 ).
cnf(c_0_43,negated_conjecture,
p_5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,negated_conjecture,
q_5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_16])]) ).
cnf(c_0_45,negated_conjecture,
~ p_6,
c_0_41 ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN003-1.006 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n014.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 10:38:49 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % new_bool_1 with pid 3849041 completed with status 0
% 0.14/0.41 % Result found by new_bool_1
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % SubtermCWHack with pid 3849046 completed with status 0
% 0.14/0.41 % Result found by SubtermCWHack
% 0.14/0.41 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.14/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 24
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 24
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 24
% 0.14/0.41 % Processed clauses : 23
% 0.14/0.41 % ...of these trivial : 4
% 0.14/0.41 % ...subsumed : 0
% 0.14/0.41 % ...remaining for further processing : 18
% 0.14/0.41 % Other redundant clauses eliminated : 0
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 0
% 0.14/0.41 % Backward-rewritten : 0
% 0.14/0.41 % Generated clauses : 0
% 0.14/0.41 % ...of the previous two non-redundant : 0
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 0
% 0.14/0.41 % Factorizations : 0
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 0
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 32
% 0.14/0.41 % ...of those cached : 16
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 18
% 0.14/0.41 % Positive orientable unit clauses : 17
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 1
% 0.14/0.41 % Non-unit-clauses : 0
% 0.14/0.41 % Current number of unprocessed clauses: 1
% 0.14/0.41 % ...number of literals in the above : 3
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 0
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.41 % Non-unit clause-clause subsumptions : 0
% 0.14/0.41 % Unit Clause-clause subsumption calls : 0
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 0
% 0.14/0.41 % BW rewrite match successes : 0
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 515
% 0.14/0.41 % Search garbage collected termcells : 43
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.002 s
% 0.14/0.41 % System time : 0.002 s
% 0.14/0.41 % Total time : 0.003 s
% 0.14/0.41 % Maximum resident set size: 3640 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.003 s
% 0.14/0.41 % System time : 0.003 s
% 0.14/0.41 % Total time : 0.006 s
% 0.14/0.41 % Maximum resident set size: 4864 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------