%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ALG005-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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 11:56:08 AM UTC 2026
% Result : Unsatisfiable 51.60s 8.02s
% Output : CNFRefutation 51.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 7 RR)
% Number of literals : 31 ( 30 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(set_difference_3,axiom,
difference(difference(X1,X2),X3) = difference(difference(X1,X3),difference(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_difference_3) ).
cnf(c_0_1,plain,
difference(difference(X1,X2),X2) = difference(X1,X2) ).
cnf(prove_associativity_of_multiply,negated_conjecture,
multiply(multiply(a,b),c) != multiply(a,multiply(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_multiply) ).
cnf(intersection,axiom,
multiply(X1,X2) = difference(X1,difference(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
cnf(c_0_4,plain,
difference(X1,difference(X2,X2)) = X1 ).
cnf(set_difference_2,axiom,
difference(X1,difference(X1,X2)) = difference(X2,difference(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_difference_2) ).
cnf(c_0_6,plain,
difference(difference(X1,difference(X1,X2)),difference(X3,difference(X2,X1))) = difference(difference(X2,X3),difference(X2,X1)) ).
cnf(c_0_7,plain,
difference(difference(X1,difference(X1,X2)),X3) = difference(X1,difference(X1,difference(X2,X3))) ).
cnf(c_0_8,plain,
difference(difference(X1,difference(X2,X3)),difference(X2,difference(X4,difference(X4,X3)))) = difference(X1,difference(X2,difference(X4,difference(X4,X3)))) ).
cnf(c_0_9,axiom,
difference(difference(X1,X2),X3) = difference(difference(X1,X3),difference(X2,X3)),
set_difference_3 ).
cnf(c_0_10,plain,
difference(difference(X1,difference(X2,X3)),X2) = difference(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9]),c_0_1]) ).
cnf(c_0_11,plain,
difference(X1,difference(X2,difference(X3,X1))) = difference(X1,X2),
inference(rw,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
multiply(multiply(a,b),c) != multiply(a,multiply(b,c)),
inference(fof_simplification,[status(thm)],[prove_associativity_of_multiply]) ).
cnf(c_0_13,plain,
difference(difference(difference(X1,X2),X3),difference(X4,X1)) = difference(difference(X1,X2),difference(X3,difference(X4,X1))),
inference(rw,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
difference(difference(difference(X1,X2),X3),X2) = difference(difference(X1,X3),X2),
inference(rw,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
multiply(multiply(a,b),c) != multiply(a,multiply(b,c)),
c_0_12 ).
cnf(c_0_16,axiom,
multiply(X1,X2) = difference(X1,difference(X1,X2)),
intersection ).
cnf(c_0_17,plain,
difference(difference(X1,X2),difference(X3,difference(X4,X1))) = difference(difference(X1,X2),X3),
inference(rw,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
difference(difference(X1,X2),X3) = difference(difference(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
difference(difference(a,difference(a,b)),difference(difference(a,difference(a,b)),c)) != difference(a,difference(a,difference(b,difference(b,c)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_20,axiom,
difference(X1,difference(X1,X2)) = difference(X2,difference(X2,X1)),
set_difference_2 ).
cnf(c_0_21,plain,
difference(difference(X1,difference(X1,X2)),X3) = difference(difference(X2,X3),difference(X2,X1)),
inference(rw,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_22,plain,
difference(difference(X1,X2),difference(X1,X3)) = difference(X1,difference(X1,difference(X3,X2))),
inference(rw,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
difference(difference(X1,X2),difference(X3,difference(X4,X2))) = difference(difference(X1,difference(X3,X4)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
difference(c,difference(c,difference(a,difference(a,b)))) != difference(a,difference(a,difference(b,difference(b,c)))),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
difference(X1,difference(X1,difference(X2,X3))) = difference(X2,difference(X2,difference(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_7]),c_0_22]) ).
cnf(c_0_26,plain,
difference(difference(X1,difference(X2,X3)),difference(X2,X4)) = difference(X1,difference(X2,difference(X3,difference(X2,X4)))),
inference(rw,[status(thm)],[c_0_23]) ).
cnf(c_0_27,plain,
difference(X1,difference(X2,difference(X3,difference(X4,X1)))) = difference(X1,difference(X2,X3)),
inference(rw,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
difference(a,difference(a,difference(c,difference(a,b)))) != difference(a,difference(a,difference(b,difference(b,c)))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
difference(X1,difference(X2,difference(X3,difference(X2,X4)))) = difference(X1,difference(X2,difference(X4,difference(X4,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG005-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n010.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 12:52:42 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 51.60/8.02 % Version: 3.5.1
% 51.60/8.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 51.60/8.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.60/8.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.60/8.02 % Starting new_bool_3 with 300s (1) cores
% 51.60/8.02 % Starting new_bool_1 with 300s (1) cores
% 51.60/8.02 % Starting sh5l with 300s (1) cores
% 51.60/8.02 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 913200 completed with status 0
% 51.60/8.02 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 51.60/8.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 51.60/8.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.60/8.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.60/8.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 51.60/8.02 % No SInE strategy applied
% 51.60/8.02 % Search class: FUUPS-FFSF22-MFFFFFNN
% 51.60/8.02 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 51.60/8.02 % Starting SubtermCWHack with 136s (1) cores
% 51.60/8.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 51.60/8.02 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 51.60/8.02 % Starting new_bool_3 with 136s (1) cores
% 51.60/8.02 % Starting new_bool_1 with 136s (1) cores
% 51.60/8.02 % G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with pid 913208 completed with status 0
% 51.60/8.02 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 51.60/8.02 % Preprocessing class: FSSSSMSSSSSNFFN.
% 51.60/8.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 51.60/8.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 51.60/8.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 51.60/8.02 % No SInE strategy applied
% 51.60/8.02 % Search class: FUUPS-FFSF22-MFFFFFNN
% 51.60/8.02 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 51.60/8.02 % Starting SubtermCWHack with 136s (1) cores
% 51.60/8.02 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 51.60/8.02 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0Y_ni with 136s (1) cores
% 51.60/8.02 % Preprocessing time : 0.001 s
% 51.60/8.02 % Presaturation interreduction done
% 51.60/8.02
% 51.60/8.02 % Proof found!
% 51.60/8.02 % SZS status Unsatisfiable
% 51.60/8.02 % SZS output start CNFRefutation
% See solution above
% 51.60/8.02 % Parsed axioms : 5
% 51.60/8.02 % Removed by relevancy pruning/SinE : 0
% 51.60/8.02 % Initial clauses : 5
% 51.60/8.02 % Removed in clause preprocessing : 1
% 51.60/8.02 % Initial clauses in saturation : 4
% 51.60/8.02 % Processed clauses : 5286
% 51.60/8.02 % ...of these trivial : 1031
% 51.60/8.02 % ...subsumed : 4039
% 51.60/8.02 % ...remaining for further processing : 216
% 51.60/8.02 % Other redundant clauses eliminated : 0
% 51.60/8.02 % Clauses deleted for lack of memory : 0
% 51.60/8.02 % Backward-subsumed : 0
% 51.60/8.02 % Backward-rewritten : 58
% 51.60/8.02 % Generated clauses : 148114
% 51.60/8.02 % ...of the previous two non-redundant : 108793
% 51.60/8.02 % ...aggressively subsumed : 0
% 51.60/8.02 % Contextual simplify-reflections : 0
% 51.60/8.02 % Paramodulations : 148114
% 51.60/8.02 % Factorizations : 0
% 51.60/8.02 % NegExts : 0
% 51.60/8.02 % Equation resolutions : 0
% 51.60/8.02 % Disequality decompositions : 0
% 51.60/8.02 % Total rewrite steps : 414405
% 51.60/8.02 % ...of those cached : 322392
% 51.60/8.02 % Propositional unsat checks : 0
% 51.60/8.02 % Propositional check models : 0
% 51.60/8.02 % Propositional check unsatisfiable : 0
% 51.60/8.02 % Propositional clauses : 0
% 51.60/8.02 % Propositional clauses after purity: 0
% 51.60/8.02 % Propositional unsat core size : 0
% 51.60/8.02 % Propositional preprocessing time : 0.000
% 51.60/8.02 % Propositional encoding time : 0.000
% 51.60/8.02 % Propositional solver time : 0.000
% 51.60/8.02 % Success case prop preproc time : 0.000
% 51.60/8.02 % Success case prop encoding time : 0.000
% 51.60/8.02 % Success case prop solver time : 0.000
% 51.60/8.02 % Current number of processed clauses : 154
% 51.60/8.02 % Positive orientable unit clauses : 138
% 51.60/8.02 % Positive unorientable unit clauses: 16
% 51.60/8.02 % Negative unit clauses : 0
% 51.60/8.02 % Non-unit-clauses : 0
% 51.60/8.02 % Current number of unprocessed clauses: 103515
% 51.60/8.02 % ...number of literals in the above : 103515
% 51.60/8.02 % Current number of archived formulas : 0
% 51.60/8.02 % Current number of archived clauses : 63
% 51.60/8.02 % Clause-clause subsumption calls (NU) : 0
% 51.60/8.02 % Rec. Clause-clause subsumption calls : 0
% 51.60/8.02 % Non-unit clause-clause subsumptions : 0
% 51.60/8.02 % Unit Clause-clause subsumption calls : 498
% 51.60/8.02 % Rewrite failures with RHS unbound : 26
% 51.60/8.02 % BW rewrite match attempts : 51263
% 51.60/8.02 % BW rewrite match successes : 304
% 51.60/8.02 % Condensation attempts : 0
% 51.60/8.02 % Condensation successes : 0
% 51.60/8.02 % Termbank termtop insertions : 3232884
% 51.60/8.02 % Search garbage collected termcells : 2
% 51.60/8.02
% 51.60/8.02 % -------------------------------------------------
% 51.60/8.02 % User time : 7.150 s
% 51.60/8.02 % System time : 0.192 s
% 51.60/8.02 % Total time : 7.341 s
% 51.60/8.02 % Maximum resident set size: 3628 pages
% 51.60/8.02
% 51.60/8.02 % -------------------------------------------------
% 51.60/8.02 % User time : 35.394 s
% 51.60/8.02 % System time : 1.007 s
% 51.60/8.02 % Total time : 36.401 s
% 51.60/8.02 % Maximum resident set size: 4864 pages
% 51.60/8.02 % E exiting
%------------------------------------------------------------------------------