%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT394-2 : TPTP v9.3.1. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 01:05:15 PM UTC 2026
% Result : Unsatisfiable 0.69s 0.79s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 4 RR)
% Number of literals : 33 ( 32 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 71 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
cnf(goals,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_2,axiom,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
sos ).
cnf(c_0_3,plain,
f(X1,f(f(X1,X2),f(f(f(X1,X2),f(f(f(X3,X1),f(X3,X1)),f(X3,X1))),X4))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
f(f(X1,X2),f(f(f(X1,X2),f(X2,X3)),X2)) = f(f(X1,X2),f(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
f(f(f(f(X1,X2),f(X2,X3)),X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
f(f(X1,X1),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_7,plain,
f(f(X1,X2),f(X1,f(f(X1,f(f(X1,X1),X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
f(X1,f(f(X1,X2),f(X1,X2))) = f(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
f(f(X1,X2),f(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
f(X1,f(f(X1,X1),X2)) = f(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
f(f(X1,X1),f(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_7]),c_0_10]),c_0_10]) ).
cnf(c_0_12,plain,
f(f(f(f(X1,X2),f(X2,X3)),X4),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_2]) ).
cnf(c_0_13,plain,
f(f(X1,X2),f(X2,f(f(X2,f(f(X1,X1),X1)),X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_14,plain,
f(f(f(X1,X2),f(X1,X2)),X1) = f(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,plain,
f(f(X1,X2),f(X2,X2)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,plain,
f(f(X1,X2),f(X2,f(f(X1,X1),X1))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_17,plain,
f(f(X1,X1),f(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
f(X1,f(f(X1,X2),f(X1,f(X1,X1)))) = f(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_9]) ).
cnf(c_0_19,plain,
f(X1,f(X2,f(X1,X1))) = f(X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_17]) ).
cnf(c_0_20,plain,
f(f(X1,X2),f(X1,f(f(X3,X3),X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_18]),c_0_19]),c_0_15]) ).
cnf(c_0_21,plain,
f(X1,X1) = f(X1,f(f(X2,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_20]) ).
cnf(c_0_22,plain,
f(f(X1,f(X2,X2)),X2) = f(X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_23,plain,
f(f(X1,X1),f(f(X2,X2),X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_21]),c_0_10]),c_0_10]) ).
cnf(c_0_24,plain,
f(f(X1,f(f(X2,X2),X2)),f(X3,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
f(f(X1,X2),f(X2,f(f(X3,X3),X3))) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_26,plain,
f(f(X1,X1),f(X2,f(X2,X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_7]),c_0_10]),c_0_10]) ).
cnf(c_0_27,plain,
f(f(X1,X1),X1) = f(f(X2,X2),X2),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_29,plain,
f(f(X1,X1),X1) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
f(x0,f(x0,x0)) != f(x1,f(x1,x1)),
c_0_28 ).
cnf(c_0_31,plain,
f(X1,f(X1,X1)) = f(X2,f(X2,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_30,c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LAT394-2 : TPTP v9.3.1. Released v5.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n001.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 00:03:43 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.54 Running first-order theorem proving
% 0.27/0.55 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.69/0.79 % Version: 3.5.1
% 0.69/0.79 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.69/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.69/0.79 % Starting new_bool_3 with 300s (1) cores
% 0.69/0.79 % Starting new_bool_1 with 300s (1) cores
% 0.69/0.79 % Starting sh5l with 300s (1) cores
% 0.69/0.79 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1768258 completed with status 0
% 0.69/0.79 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.69/0.79 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.69/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.69/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.69/0.79 % No SInE strategy applied
% 0.69/0.79 % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.69/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.79 % Starting SubtermCWHack with 136s (1) cores
% 0.69/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.69/0.79 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.69/0.79 % Starting new_bool_3 with 136s (1) cores
% 0.69/0.79 % Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.69/0.79 % G----_0008_C18_F1_SE_CS_SP_S0Y with pid 1768262 completed with status 0
% 0.69/0.79 % Result found by G----_0008_C18_F1_SE_CS_SP_S0Y
% 0.69/0.79 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.69/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.69/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.69/0.79 % No SInE strategy applied
% 0.69/0.79 % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.69/0.79 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.79 % Starting SubtermCWHack with 136s (1) cores
% 0.69/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.69/0.79 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.69/0.79 % Preprocessing time : 0.001 s
% 0.69/0.79
% 0.69/0.79 % Proof found!
% 0.69/0.79 % SZS status Unsatisfiable
% 0.69/0.79 % SZS output start CNFRefutation
% See solution above
% 0.69/0.79 % Parsed axioms : 2
% 0.69/0.79 % Removed by relevancy pruning/SinE : 0
% 0.69/0.79 % Initial clauses : 2
% 0.69/0.79 % Removed in clause preprocessing : 0
% 0.69/0.79 % Initial clauses in saturation : 2
% 0.69/0.79 % Processed clauses : 294
% 0.69/0.79 % ...of these trivial : 72
% 0.69/0.79 % ...subsumed : 165
% 0.69/0.79 % ...remaining for further processing : 57
% 0.69/0.79 % Other redundant clauses eliminated : 0
% 0.69/0.79 % Clauses deleted for lack of memory : 0
% 0.69/0.79 % Backward-subsumed : 0
% 0.69/0.79 % Backward-rewritten : 7
% 0.69/0.79 % Generated clauses : 6656
% 0.69/0.79 % ...of the previous two non-redundant : 2844
% 0.69/0.79 % ...aggressively subsumed : 0
% 0.69/0.79 % Contextual simplify-reflections : 0
% 0.69/0.79 % Paramodulations : 6655
% 0.69/0.79 % Factorizations : 0
% 0.69/0.79 % NegExts : 0
% 0.69/0.79 % Equation resolutions : 0
% 0.69/0.79 % Disequality decompositions : 0
% 0.69/0.79 % Total rewrite steps : 6259
% 0.69/0.79 % ...of those cached : 5606
% 0.69/0.79 % Propositional unsat checks : 0
% 0.69/0.79 % Propositional check models : 0
% 0.69/0.79 % Propositional check unsatisfiable : 0
% 0.69/0.79 % Propositional clauses : 0
% 0.69/0.79 % Propositional clauses after purity: 0
% 0.69/0.79 % Propositional unsat core size : 0
% 0.69/0.79 % Propositional preprocessing time : 0.000
% 0.69/0.79 % Propositional encoding time : 0.000
% 0.69/0.79 % Propositional solver time : 0.000
% 0.69/0.79 % Success case prop preproc time : 0.000
% 0.69/0.79 % Success case prop encoding time : 0.000
% 0.69/0.79 % Success case prop solver time : 0.000
% 0.69/0.79 % Current number of processed clauses : 49
% 0.69/0.79 % Positive orientable unit clauses : 42
% 0.69/0.79 % Positive unorientable unit clauses: 7
% 0.69/0.79 % Negative unit clauses : 0
% 0.69/0.79 % Non-unit-clauses : 0
% 0.69/0.79 % Current number of unprocessed clauses: 2539
% 0.69/0.79 % ...number of literals in the above : 2539
% 0.69/0.79 % Current number of archived formulas : 0
% 0.69/0.79 % Current number of archived clauses : 8
% 0.69/0.79 % Clause-clause subsumption calls (NU) : 0
% 0.69/0.79 % Rec. Clause-clause subsumption calls : 0
% 0.69/0.79 % Non-unit clause-clause subsumptions : 0
% 0.69/0.79 % Unit Clause-clause subsumption calls : 275
% 0.69/0.79 % Rewrite failures with RHS unbound : 122
% 0.69/0.79 % BW rewrite match attempts : 960
% 0.69/0.79 % BW rewrite match successes : 59
% 0.69/0.79 % Condensation attempts : 0
% 0.69/0.79 % Condensation successes : 0
% 0.69/0.79 % Termbank termtop insertions : 69832
% 0.69/0.79 % Search garbage collected termcells : 2
% 0.69/0.79
% 0.69/0.79 % -------------------------------------------------
% 0.69/0.79 % User time : 0.094 s
% 0.69/0.79 % System time : 0.007 s
% 0.69/0.79 % Total time : 0.101 s
% 0.69/0.79 % Maximum resident set size: 3376 pages
% 0.69/0.79
% 0.69/0.79 % -------------------------------------------------
% 0.69/0.79 % User time : 0.611 s
% 0.69/0.79 % System time : 0.041 s
% 0.69/0.79 % Total time : 0.652 s
% 0.69/0.79 % Maximum resident set size: 4608 pages
% 0.69/0.79 % E exiting
%------------------------------------------------------------------------------