%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN028-1 : 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 : n004.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:20 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.55s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 8 unt; 2 nHn; 22 RR)
% Number of literals : 39 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_something,negated_conjecture,
~ p,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_something) ).
cnf(clause2,axiom,
( ~ q
| r ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).
cnf(clause1,axiom,
( p
| q ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).
cnf(clause3,axiom,
( ~ r
| s ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).
cnf(clause5,axiom,
( ~ t
| p ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).
cnf(clause4,axiom,
( ~ r
| ~ s
| t ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).
cnf(c_0_6,negated_conjecture,
~ p,
inference(fof_simplification,[status(thm)],[prove_something]) ).
cnf(c_0_7,plain,
( ~ q
| r ),
inference(fof_simplification,[status(thm)],[clause2]) ).
cnf(c_0_8,axiom,
( p
| q ),
clause1 ).
cnf(c_0_9,negated_conjecture,
~ p,
c_0_6 ).
cnf(c_0_10,plain,
( ~ r
| s ),
inference(fof_simplification,[status(thm)],[clause3]) ).
cnf(c_0_11,plain,
( ~ q
| r ),
c_0_7 ).
cnf(c_0_12,plain,
q,
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ t
| p ),
inference(fof_simplification,[status(thm)],[clause5]) ).
cnf(c_0_14,plain,
( ~ r
| ~ s
| t ),
inference(fof_simplification,[status(thm)],[clause4]) ).
cnf(c_0_15,plain,
( ~ r
| s ),
c_0_10 ).
cnf(c_0_16,plain,
r,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_17,plain,
( ~ t
| p ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ r
| ~ s
| t ),
c_0_14 ).
cnf(c_0_19,plain,
s,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_20,plain,
~ t,
inference(sr,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_16]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN028-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n004.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 10:39:34 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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.25/0.55 % Version: 3.5.1
% 0.25/0.55 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.55 % Starting sh5l with 300s (1) cores
% 0.25/0.55 % new_bool_3 with pid 2932195 completed with status 0
% 0.25/0.55 % Result found by new_bool_3
% 0.25/0.55 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.55 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.25/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.55 % SubtermCWHack with pid 2932201 completed with status 0
% 0.25/0.55 % Result found by SubtermCWHack
% 0.25/0.55 % Preprocessing class: FSSSSLSSSSSNFFN.
% 0.25/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.55 % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.25/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.55 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.25/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.55 % Preprocessing time : 0.002 s
% 0.25/0.55
% 0.25/0.55 % Proof found!
% 0.25/0.55 % SZS status Unsatisfiable
% 0.25/0.55 % SZS output start CNFRefutation
% See solution above
% 0.25/0.55 % Parsed axioms : 6
% 0.25/0.55 % Removed by relevancy pruning/SinE : 0
% 0.25/0.55 % Initial clauses : 6
% 0.25/0.55 % Removed in clause preprocessing : 0
% 0.25/0.55 % Initial clauses in saturation : 6
% 0.25/0.55 % Processed clauses : 6
% 0.25/0.55 % ...of these trivial : 0
% 0.25/0.55 % ...subsumed : 0
% 0.25/0.55 % ...remaining for further processing : 5
% 0.25/0.55 % Other redundant clauses eliminated : 0
% 0.25/0.55 % Clauses deleted for lack of memory : 0
% 0.25/0.55 % Backward-subsumed : 0
% 0.25/0.55 % Backward-rewritten : 0
% 0.25/0.55 % Generated clauses : 0
% 0.25/0.55 % ...of the previous two non-redundant : 0
% 0.25/0.55 % ...aggressively subsumed : 0
% 0.25/0.55 % Contextual simplify-reflections : 0
% 0.25/0.55 % Paramodulations : 0
% 0.25/0.55 % Factorizations : 0
% 0.25/0.55 % NegExts : 0
% 0.25/0.55 % Equation resolutions : 0
% 0.25/0.55 % Disequality decompositions : 0
% 0.25/0.55 % Total rewrite steps : 4
% 0.25/0.55 % ...of those cached : 1
% 0.25/0.55 % Propositional unsat checks : 0
% 0.25/0.55 % Propositional check models : 0
% 0.25/0.55 % Propositional check unsatisfiable : 0
% 0.25/0.55 % Propositional clauses : 0
% 0.25/0.55 % Propositional clauses after purity: 0
% 0.25/0.55 % Propositional unsat core size : 0
% 0.25/0.55 % Propositional preprocessing time : 0.000
% 0.25/0.55 % Propositional encoding time : 0.000
% 0.25/0.55 % Propositional solver time : 0.000
% 0.25/0.55 % Success case prop preproc time : 0.000
% 0.25/0.55 % Success case prop encoding time : 0.000
% 0.25/0.55 % Success case prop solver time : 0.000
% 0.25/0.55 % Current number of processed clauses : 5
% 0.25/0.55 % Positive orientable unit clauses : 3
% 0.25/0.55 % Positive unorientable unit clauses: 0
% 0.25/0.55 % Negative unit clauses : 2
% 0.25/0.55 % Non-unit-clauses : 0
% 0.25/0.55 % Current number of unprocessed clauses: 0
% 0.25/0.55 % ...number of literals in the above : 0
% 0.25/0.55 % Current number of archived formulas : 0
% 0.25/0.55 % Current number of archived clauses : 0
% 0.25/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.55 % Non-unit clause-clause subsumptions : 0
% 0.25/0.55 % Unit Clause-clause subsumption calls : 0
% 0.25/0.55 % Rewrite failures with RHS unbound : 0
% 0.25/0.55 % BW rewrite match attempts : 0
% 0.25/0.55 % BW rewrite match successes : 0
% 0.25/0.55 % Condensation attempts : 0
% 0.25/0.55 % Condensation successes : 0
% 0.25/0.55 % Termbank termtop insertions : 108
% 0.25/0.55 % Search garbage collected termcells : 10
% 0.25/0.55
% 0.25/0.55 % -------------------------------------------------
% 0.25/0.55 % User time : 0.001 s
% 0.25/0.55 % System time : 0.004 s
% 0.25/0.55 % Total time : 0.005 s
% 0.25/0.55 % Maximum resident set size: 3624 pages
% 0.25/0.55
% 0.25/0.55 % -------------------------------------------------
% 0.25/0.55 % User time : 0.003 s
% 0.25/0.55 % System time : 0.010 s
% 0.25/0.55 % Total time : 0.013 s
% 0.25/0.55 % Maximum resident set size: 4608 pages
% 0.25/0.55 % E exiting
%------------------------------------------------------------------------------