%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CAT019-3 : 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 12:08:04 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 6 unt; 7 nHn; 12 RR)
% Number of literals : 42 ( 27 equ; 17 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(equality_of_a_and_b2,hypothesis,
( b != X1
| ~ there_exists(X1)
| a = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equality_of_a_and_b2) ).
cnf(prove_a_equals_b,negated_conjecture,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_equals_b) ).
cnf(indiscernibles1,axiom,
( X1 = X2
| there_exists(f1(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',indiscernibles1) ).
cnf(indiscernibles2,axiom,
( X1 = X2
| X2 = f1(X1,X2)
| X1 = f1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',indiscernibles2) ).
cnf(equality_of_a_and_b1,hypothesis,
( a != X1
| ~ there_exists(X1)
| b = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equality_of_a_and_b1) ).
cnf(c_0_5,hypothesis,
( b != X1
| ~ there_exists(X1)
| a = X1 ),
inference(fof_simplification,[status(thm)],[equality_of_a_and_b2]) ).
cnf(c_0_6,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_a_equals_b]) ).
cnf(c_0_7,axiom,
( X1 = X2
| there_exists(f1(X1,X2)) ),
indiscernibles1 ).
cnf(c_0_8,axiom,
( X1 = X2
| X2 = f1(X1,X2)
| X1 = f1(X1,X2) ),
indiscernibles2 ).
cnf(c_0_9,hypothesis,
( a != X1
| ~ there_exists(X1)
| b = X1 ),
inference(fof_simplification,[status(thm)],[equality_of_a_and_b1]) ).
cnf(c_0_10,hypothesis,
( b != X1
| ~ there_exists(X1)
| a = X1 ),
c_0_5 ).
cnf(c_0_11,negated_conjecture,
a != b,
c_0_6 ).
cnf(c_0_12,plain,
( there_exists(X2)
| X1 = X2
| f1(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,hypothesis,
( a != X1
| ~ there_exists(X1)
| b = X1 ),
c_0_9 ).
cnf(c_0_14,hypothesis,
~ there_exists(b),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( there_exists(X1)
| there_exists(X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,hypothesis,
~ there_exists(a),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_13]),c_0_11]) ).
cnf(c_0_17,hypothesis,
( there_exists(X1)
| b = X1 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : CAT019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n017.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 13:52:13 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.52 Running first-order theorem proving
% 0.19/0.52 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.23/0.55 % Version: 3.5.1
% 0.23/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % Starting sh5l with 300s (1) cores
% 0.23/0.55 % sh5l with pid 2480808 completed with status 0
% 0.23/0.55 % Result found by sh5l
% 0.23/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % Starting sh5l with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.55 % Search class: FGUSS-FFSF21-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % SubtermCWHack with pid 2480816 completed with status 0
% 0.23/0.55 % Result found by SubtermCWHack
% 0.23/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 % Starting sh5l with 300s (1) cores
% 0.23/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.23/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.55 % Search class: FGUSS-FFSF21-SFFFFFNN
% 0.23/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.55 % Preprocessing time : 0.002 s
% 0.23/0.55
% 0.23/0.55 % Proof found!
% 0.23/0.55 % SZS status Unsatisfiable
% 0.23/0.55 % SZS output start CNFRefutation
% See solution above
% 0.23/0.55 % Parsed axioms : 20
% 0.23/0.55 % Removed by relevancy pruning/SinE : 0
% 0.23/0.55 % Initial clauses : 20
% 0.23/0.55 % Removed in clause preprocessing : 1
% 0.23/0.55 % Initial clauses in saturation : 19
% 0.23/0.55 % Processed clauses : 41
% 0.23/0.55 % ...of these trivial : 0
% 0.23/0.55 % ...subsumed : 10
% 0.23/0.55 % ...remaining for further processing : 31
% 0.23/0.55 % Other redundant clauses eliminated : 4
% 0.23/0.55 % Clauses deleted for lack of memory : 0
% 0.23/0.55 % Backward-subsumed : 0
% 0.23/0.55 % Backward-rewritten : 0
% 0.23/0.55 % Generated clauses : 116
% 0.23/0.55 % ...of the previous two non-redundant : 88
% 0.23/0.55 % ...aggressively subsumed : 0
% 0.23/0.55 % Contextual simplify-reflections : 0
% 0.23/0.55 % Paramodulations : 108
% 0.23/0.55 % Factorizations : 4
% 0.23/0.55 % NegExts : 0
% 0.23/0.55 % Equation resolutions : 4
% 0.23/0.55 % Disequality decompositions : 0
% 0.23/0.55 % Total rewrite steps : 4
% 0.23/0.55 % ...of those cached : 2
% 0.23/0.55 % Propositional unsat checks : 0
% 0.23/0.55 % Propositional check models : 0
% 0.23/0.55 % Propositional check unsatisfiable : 0
% 0.23/0.55 % Propositional clauses : 0
% 0.23/0.55 % Propositional clauses after purity: 0
% 0.23/0.55 % Propositional unsat core size : 0
% 0.23/0.55 % Propositional preprocessing time : 0.000
% 0.23/0.55 % Propositional encoding time : 0.000
% 0.23/0.55 % Propositional solver time : 0.000
% 0.23/0.55 % Success case prop preproc time : 0.000
% 0.23/0.55 % Success case prop encoding time : 0.000
% 0.23/0.55 % Success case prop solver time : 0.000
% 0.23/0.55 % Current number of processed clauses : 27
% 0.23/0.55 % Positive orientable unit clauses : 2
% 0.23/0.55 % Positive unorientable unit clauses: 0
% 0.23/0.55 % Negative unit clauses : 3
% 0.23/0.55 % Non-unit-clauses : 22
% 0.23/0.55 % Current number of unprocessed clauses: 66
% 0.23/0.55 % ...number of literals in the above : 221
% 0.23/0.55 % Current number of archived formulas : 0
% 0.23/0.55 % Current number of archived clauses : 0
% 0.23/0.55 % Clause-clause subsumption calls (NU) : 34
% 0.23/0.55 % Rec. Clause-clause subsumption calls : 30
% 0.23/0.55 % Non-unit clause-clause subsumptions : 10
% 0.23/0.55 % Unit Clause-clause subsumption calls : 0
% 0.23/0.55 % Rewrite failures with RHS unbound : 0
% 0.23/0.55 % BW rewrite match attempts : 0
% 0.23/0.55 % BW rewrite match successes : 0
% 0.23/0.55 % Condensation attempts : 0
% 0.23/0.55 % Condensation successes : 0
% 0.23/0.55 % Termbank termtop insertions : 1273
% 0.23/0.55 % Search garbage collected termcells : 34
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.007 s
% 0.23/0.55 % System time : 0.003 s
% 0.23/0.55 % Total time : 0.010 s
% 0.23/0.55 % Maximum resident set size: 3900 pages
% 0.23/0.55
% 0.23/0.55 % -------------------------------------------------
% 0.23/0.55 % User time : 0.009 s
% 0.23/0.55 % System time : 0.006 s
% 0.23/0.55 % Total time : 0.015 s
% 0.23/0.55 % Maximum resident set size: 4864 pages
% 0.23/0.55 % E exiting
%------------------------------------------------------------------------------