%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN187-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:32:43 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.66s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 13 unt; 0 nHn; 17 RR)
% Number of literals : 39 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 26 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_092,axiom,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_092) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(axiom_26,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_26) ).
cnf(prove_this,negated_conjecture,
~ r1(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_33) ).
cnf(c_0_7,plain,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_092]) ).
cnf(c_0_8,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_9,plain,
( ~ p0(X4,X1)
| ~ n0(X3,X2)
| q1(X1,X2,X1) ),
c_0_7 ).
cnf(c_0_10,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_11,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_8 ).
cnf(c_0_12,axiom,
s0(d),
axiom_1 ).
cnf(c_0_13,plain,
( ~ n0(X3,X2)
| q1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
n0(d,c),
axiom_26 ).
cnf(c_0_15,negated_conjecture,
~ r1(d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_16,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_17,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_18,plain,
q1(X1,c,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ r1(d),
c_0_15 ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN187-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.56 % Computer : n020.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 10:46:18 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.61 Running first-order theorem proving
% 0.14/0.61 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.66 % Version: 3.5.1
% 0.14/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.66 % Starting sh5l with 300s (1) cores
% 0.14/0.66 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2726221 completed with status 0
% 0.14/0.66 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.66 % No SInE strategy applied
% 0.14/0.66 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.66 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.66 % SubtermCWHack with pid 2726225 completed with status 0
% 0.14/0.66 % Result found by SubtermCWHack
% 0.14/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.66 % No SInE strategy applied
% 0.14/0.66 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.66 % Preprocessing time : 0.003 s
% 0.14/0.66
% 0.14/0.66 % Proof found!
% 0.14/0.66 % SZS status Unsatisfiable
% 0.14/0.66 % SZS output start CNFRefutation
% See solution above
% 0.14/0.66 % Parsed axioms : 369
% 0.14/0.66 % Removed by relevancy pruning/SinE : 0
% 0.14/0.66 % Initial clauses : 369
% 0.14/0.66 % Removed in clause preprocessing : 7
% 0.14/0.66 % Initial clauses in saturation : 362
% 0.14/0.66 % Processed clauses : 528
% 0.14/0.66 % ...of these trivial : 67
% 0.14/0.66 % ...subsumed : 9
% 0.14/0.66 % ...remaining for further processing : 452
% 0.14/0.66 % Other redundant clauses eliminated : 0
% 0.14/0.66 % Clauses deleted for lack of memory : 0
% 0.14/0.66 % Backward-subsumed : 30
% 0.14/0.66 % Backward-rewritten : 162
% 0.14/0.66 % Generated clauses : 472
% 0.14/0.66 % ...of the previous two non-redundant : 328
% 0.14/0.66 % ...aggressively subsumed : 0
% 0.14/0.66 % Contextual simplify-reflections : 0
% 0.14/0.66 % Paramodulations : 472
% 0.14/0.66 % Factorizations : 0
% 0.14/0.66 % NegExts : 0
% 0.14/0.66 % Equation resolutions : 0
% 0.14/0.66 % Disequality decompositions : 0
% 0.14/0.66 % Total rewrite steps : 487
% 0.14/0.66 % ...of those cached : 271
% 0.14/0.66 % Propositional unsat checks : 0
% 0.14/0.66 % Propositional check models : 0
% 0.14/0.66 % Propositional check unsatisfiable : 0
% 0.14/0.66 % Propositional clauses : 0
% 0.14/0.66 % Propositional clauses after purity: 0
% 0.14/0.66 % Propositional unsat core size : 0
% 0.14/0.66 % Propositional preprocessing time : 0.000
% 0.14/0.66 % Propositional encoding time : 0.000
% 0.14/0.66 % Propositional solver time : 0.000
% 0.14/0.66 % Success case prop preproc time : 0.000
% 0.14/0.66 % Success case prop encoding time : 0.000
% 0.14/0.66 % Success case prop solver time : 0.000
% 0.14/0.66 % Current number of processed clauses : 260
% 0.14/0.66 % Positive orientable unit clauses : 138
% 0.14/0.66 % Positive unorientable unit clauses: 0
% 0.14/0.66 % Negative unit clauses : 1
% 0.14/0.66 % Non-unit-clauses : 121
% 0.14/0.66 % Current number of unprocessed clauses: 119
% 0.14/0.66 % ...number of literals in the above : 446
% 0.14/0.66 % Current number of archived formulas : 0
% 0.14/0.66 % Current number of archived clauses : 192
% 0.14/0.66 % Clause-clause subsumption calls (NU) : 5730
% 0.14/0.66 % Rec. Clause-clause subsumption calls : 5069
% 0.14/0.66 % Non-unit clause-clause subsumptions : 30
% 0.14/0.66 % Unit Clause-clause subsumption calls : 1132
% 0.14/0.66 % Rewrite failures with RHS unbound : 0
% 0.14/0.66 % BW rewrite match attempts : 198
% 0.14/0.66 % BW rewrite match successes : 135
% 0.14/0.66 % Condensation attempts : 0
% 0.14/0.66 % Condensation successes : 0
% 0.14/0.66 % Termbank termtop insertions : 17026
% 0.14/0.66 % Search garbage collected termcells : 1459
% 0.14/0.66
% 0.14/0.66 % -------------------------------------------------
% 0.14/0.66 % User time : 0.022 s
% 0.14/0.66 % System time : 0.005 s
% 0.14/0.66 % Total time : 0.026 s
% 0.14/0.66 % Maximum resident set size: 4420 pages
% 0.14/0.66
% 0.14/0.66 % -------------------------------------------------
% 0.14/0.66 % User time : 0.086 s
% 0.14/0.66 % System time : 0.020 s
% 0.14/0.66 % Total time : 0.107 s
% 0.14/0.66 % Maximum resident set size: 5120 pages
% 0.14/0.66 % E exiting
%------------------------------------------------------------------------------