%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN072-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:23:02 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 23 ( 11 unt; 8 nHn; 18 RR)
% Number of literals : 39 ( 25 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ big_p(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(clause_1,axiom,
( X1 = d
| X1 = c ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,axiom,
big_p(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_2,axiom,
big_p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_4,axiom,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(c_0_5,negated_conjecture,
~ big_p(e),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_6,negated_conjecture,
~ big_p(e),
c_0_5 ).
cnf(c_0_7,axiom,
( X1 = d
| X1 = c ),
clause_1 ).
cnf(c_0_8,negated_conjecture,
( ~ big_p(d)
| e = c ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
( ~ big_p(X1)
| X1 = c
| e = c ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,axiom,
big_p(b),
clause_3 ).
cnf(c_0_11,negated_conjecture,
( e = c
| c = b ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
big_p(a),
clause_2 ).
cnf(c_0_13,negated_conjecture,
( ~ big_p(c)
| c = b ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
( X2 = X1
| X2 = c
| X1 = c ),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_15,plain,
a != b,
inference(fof_simplification,[status(thm)],[clause_4]) ).
cnf(c_0_16,negated_conjecture,
( e = c
| c = a ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_p(X2)
| X1 = X2
| X2 = b
| X1 = c ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
a != b,
c_0_15 ).
cnf(c_0_19,negated_conjecture,
( ~ big_p(c)
| c = a ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( X1 = c
| X1 = a ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ big_p(X1)
| X1 = a ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN072-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:37:28 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2119000 completed with status 0
% 0.11/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % new_bool_3 with pid 2119010 completed with status 0
% 0.11/0.44 % Result found by new_bool_3
% 0.11/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44 % Presaturation interreduction done
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 5
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 5
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 5
% 0.11/0.44 % Processed clauses : 44
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 22
% 0.11/0.44 % ...remaining for further processing : 22
% 0.11/0.44 % Other redundant clauses eliminated : 4
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 1
% 0.11/0.44 % Backward-rewritten : 0
% 0.11/0.44 % Generated clauses : 114
% 0.11/0.44 % ...of the previous two non-redundant : 78
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 76
% 0.11/0.44 % Factorizations : 34
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 4
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 0
% 0.11/0.44 % ...of those cached : 0
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 16
% 0.11/0.44 % Positive orientable unit clauses : 2
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 2
% 0.11/0.44 % Non-unit-clauses : 12
% 0.11/0.44 % Current number of unprocessed clauses: 44
% 0.11/0.44 % ...number of literals in the above : 170
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 6
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 117
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 100
% 0.11/0.44 % Non-unit clause-clause subsumptions : 23
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 0
% 0.11/0.44 % BW rewrite match successes : 0
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 395
% 0.11/0.44 % Search garbage collected termcells : 4
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.002 s
% 0.11/0.44 % System time : 0.002 s
% 0.11/0.44 % Total time : 0.005 s
% 0.11/0.44 % Maximum resident set size: 3372 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.013 s
% 0.11/0.44 % System time : 0.012 s
% 0.11/0.44 % Total time : 0.024 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------