%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP116-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:37:55 PM UTC 2026
% Result : Unsatisfiable 0.08s 15.49s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 4 RR)
% Number of literals : 15 ( 14 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 : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),X3)),multiply(identity,multiply(X3,X3)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_order3,negated_conjecture,
multiply(identity,a) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_order3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),X3)),multiply(identity,multiply(X3,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(multiply(X1,multiply(multiply(X1,X2),multiply(identity,multiply(multiply(identity,X3),multiply(identity,X3))))),X3)) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(multiply(X1,X2),multiply(identity,X3)) = multiply(X1,multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X1,multiply(multiply(multiply(X1,X2),X3),multiply(X3,X3)))) = X2,
inference(rw,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(X1,multiply(X1,multiply(multiply(X2,X3),multiply(X3,X3))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_4]),c_0_4]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,multiply(X2,X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_7]),c_0_4]),c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(X1,multiply(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
cnf(c_0_10,negated_conjecture,
multiply(identity,a) != a,
inference(fof_simplification,[status(thm)],[prove_order3]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(X1,X1)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
multiply(identity,a) != a,
c_0_10 ).
cnf(c_0_13,plain,
multiply(identity,X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP116-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/15.42 % CPULimit : 300
% 0.08/15.42 % WCLimit : 300
% 0.08/15.43 % DateTime : Sun Sep 20 19:58:05 UTC 2026
% 0.08/15.43 % CPUTime :
% 0.08/15.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/15.47 Running first-order theorem proving
% 0.08/15.47 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.08/15.49 % Version: 3.5.1
% 0.08/15.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/15.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/15.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/15.49 % Starting new_bool_3 with 300s (1) cores
% 0.08/15.49 % Starting new_bool_1 with 300s (1) cores
% 0.08/15.49 % Starting sh5l with 300s (1) cores
% 0.08/15.49 % new_bool_3 with pid 1355900 completed with status 0
% 0.08/15.49 % Result found by new_bool_3
% 0.08/15.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/15.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/15.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/15.49 % Starting new_bool_3 with 300s (1) cores
% 0.08/15.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/15.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/15.49 % Search class: FUUPF-FFSF22-MFFFFFNN
% 0.08/15.49 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.08/15.49 % Starting SubtermCWHack with 31s (1) cores
% 0.08/15.49 % SubtermCWHack with pid 1355907 completed with status 0
% 0.08/15.49 % Result found by SubtermCWHack
% 0.08/15.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/15.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/15.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/15.49 % Starting new_bool_3 with 300s (1) cores
% 0.08/15.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/15.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/15.49 % Search class: FUUPF-FFSF22-MFFFFFNN
% 0.08/15.49 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.08/15.49 % Starting SubtermCWHack with 31s (1) cores
% 0.08/15.49 % Preprocessing time : 0.001 s
% 0.08/15.49
% 0.08/15.49 % Proof found!
% 0.08/15.49 % SZS status Unsatisfiable
% 0.08/15.49 % SZS output start CNFRefutation
% See solution above
% 0.08/15.49 % Parsed axioms : 2
% 0.08/15.49 % Removed by relevancy pruning/SinE : 0
% 0.08/15.49 % Initial clauses : 2
% 0.08/15.49 % Removed in clause preprocessing : 0
% 0.08/15.49 % Initial clauses in saturation : 2
% 0.08/15.49 % Processed clauses : 15
% 0.08/15.49 % ...of these trivial : 1
% 0.08/15.49 % ...subsumed : 0
% 0.08/15.49 % ...remaining for further processing : 14
% 0.08/15.49 % Other redundant clauses eliminated : 0
% 0.08/15.49 % Clauses deleted for lack of memory : 0
% 0.08/15.49 % Backward-subsumed : 0
% 0.08/15.49 % Backward-rewritten : 6
% 0.08/15.49 % Generated clauses : 179
% 0.08/15.49 % ...of the previous two non-redundant : 139
% 0.08/15.49 % ...aggressively subsumed : 0
% 0.08/15.49 % Contextual simplify-reflections : 0
% 0.08/15.49 % Paramodulations : 179
% 0.08/15.49 % Factorizations : 0
% 0.08/15.49 % NegExts : 0
% 0.08/15.49 % Equation resolutions : 0
% 0.08/15.49 % Disequality decompositions : 0
% 0.08/15.49 % Total rewrite steps : 195
% 0.08/15.49 % ...of those cached : 125
% 0.08/15.49 % Propositional unsat checks : 0
% 0.08/15.49 % Propositional check models : 0
% 0.08/15.49 % Propositional check unsatisfiable : 0
% 0.08/15.49 % Propositional clauses : 0
% 0.08/15.49 % Propositional clauses after purity: 0
% 0.08/15.49 % Propositional unsat core size : 0
% 0.08/15.49 % Propositional preprocessing time : 0.000
% 0.08/15.49 % Propositional encoding time : 0.000
% 0.08/15.49 % Propositional solver time : 0.000
% 0.08/15.49 % Success case prop preproc time : 0.000
% 0.08/15.49 % Success case prop encoding time : 0.000
% 0.08/15.49 % Success case prop solver time : 0.000
% 0.08/15.49 % Current number of processed clauses : 8
% 0.08/15.49 % Positive orientable unit clauses : 8
% 0.08/15.49 % Positive unorientable unit clauses: 0
% 0.08/15.49 % Negative unit clauses : 0
% 0.08/15.49 % Non-unit-clauses : 0
% 0.08/15.49 % Current number of unprocessed clauses: 121
% 0.08/15.49 % ...number of literals in the above : 121
% 0.08/15.49 % Current number of archived formulas : 0
% 0.08/15.49 % Current number of archived clauses : 6
% 0.08/15.49 % Clause-clause subsumption calls (NU) : 0
% 0.08/15.49 % Rec. Clause-clause subsumption calls : 0
% 0.08/15.49 % Non-unit clause-clause subsumptions : 0
% 0.08/15.49 % Unit Clause-clause subsumption calls : 0
% 0.08/15.49 % Rewrite failures with RHS unbound : 0
% 0.08/15.49 % BW rewrite match attempts : 31
% 0.08/15.49 % BW rewrite match successes : 7
% 0.08/15.49 % Condensation attempts : 0
% 0.08/15.49 % Condensation successes : 0
% 0.08/15.49 % Termbank termtop insertions : 2919
% 0.08/15.49 % Search garbage collected termcells : 2
% 0.08/15.49
% 0.08/15.49 % -------------------------------------------------
% 0.08/15.49 % User time : 0.003 s
% 0.08/15.49 % System time : 0.002 s
% 0.08/15.49 % Total time : 0.005 s
% 0.08/15.49 % Maximum resident set size: 3632 pages
% 0.08/15.49
% 0.08/15.49 % -------------------------------------------------
% 0.08/15.49 % User time : 0.003 s
% 0.08/15.49 % System time : 0.008 s
% 0.08/15.49 % Total time : 0.011 s
% 0.08/15.49 % Maximum resident set size: 4608 pages
% 0.08/15.49 % E exiting
%------------------------------------------------------------------------------