%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP045-2 : 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 : 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:41:28 PM UTC 2026
% Result : Unsatisfiable 0.33s 0.46s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 14 unt; 0 nHn; 24 RR)
% Number of literals : 59 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity2,axiom,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',associativity2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',left_identity) ).
cnf(product_with_a,hypothesis,
product(c,a,result),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_with_a) ).
cnf(product_substitution3,axiom,
( ~ product(X3,X4,X1)
| ~ equalish(X1,X2)
| product(X3,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',product_substitution3) ).
cnf(associativity1,axiom,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',associativity1) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP005-0.ax',total_function1) ).
cnf(a_equals_b,hypothesis,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b) ).
cnf(prove_product_with_b,negated_conjecture,
~ product(c,b,result),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_product_with_b) ).
cnf(c_0_8,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_9,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
c_0_8 ).
cnf(c_0_10,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_11,plain,
( ~ product(X4,X2,X3)
| ~ product(X4,identity,X1)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,hypothesis,
product(c,a,result),
product_with_a ).
cnf(c_0_13,plain,
( ~ product(X3,X4,X1)
| ~ equalish(X1,X2)
| product(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[product_substitution3]) ).
cnf(c_0_14,plain,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity1]) ).
cnf(c_0_15,hypothesis,
( ~ product(c,identity,X1)
| product(X1,a,result) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_17,plain,
( ~ product(X3,X4,X1)
| ~ equalish(X1,X2)
| product(X3,X4,X2) ),
c_0_13 ).
cnf(c_0_18,hypothesis,
equalish(a,b),
a_equals_b ).
cnf(c_0_19,plain,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
c_0_14 ).
cnf(c_0_20,hypothesis,
product(multiply(c,identity),a,result),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
( ~ product(X1,X2,a)
| product(X1,X2,b) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
( ~ product(X3,a,X2)
| ~ product(X1,X3,multiply(c,identity))
| product(X1,X2,result) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
product(identity,a,b),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_24,negated_conjecture,
~ product(c,b,result),
inference(fof_simplification,[status(thm)],[prove_product_with_b]) ).
cnf(c_0_25,hypothesis,
( ~ product(X1,identity,multiply(c,identity))
| product(X1,b,result) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ product(c,b,result),
c_0_24 ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP045-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n011.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 19:55:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.33/0.46 % Version: 3.5.1
% 0.33/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.46 % Starting sh5l with 300s (1) cores
% 0.33/0.46 % new_bool_1 with pid 28054 completed with status 9
% 0.33/0.46 % new_bool_3 with pid 28053 completed with status 9
% 0.33/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28052 completed with status 0
% 0.33/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.33/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.46 % No SInE strategy applied
% 0.33/0.46 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.33/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.46 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.33/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.33/0.46 % new_bool_3 with pid 28063 completed with status 0
% 0.33/0.46 % Result found by new_bool_3
% 0.33/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.46 % No SInE strategy applied
% 0.33/0.46 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.33/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/0.46 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.33/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.46 % Preprocessing time : 0.001 s
% 0.33/0.46 % Presaturation interreduction done
% 0.33/0.46
% 0.33/0.46 % Proof found!
% 0.33/0.46 % SZS status Unsatisfiable
% 0.33/0.46 % SZS output start CNFRefutation
% See solution above
% 0.33/0.46 % Parsed axioms : 10
% 0.33/0.46 % Removed by relevancy pruning/SinE : 0
% 0.33/0.46 % Initial clauses : 10
% 0.33/0.46 % Removed in clause preprocessing : 0
% 0.33/0.46 % Initial clauses in saturation : 10
% 0.33/0.46 % Processed clauses : 311
% 0.33/0.46 % ...of these trivial : 12
% 0.33/0.46 % ...subsumed : 28
% 0.33/0.46 % ...remaining for further processing : 271
% 0.33/0.46 % Other redundant clauses eliminated : 0
% 0.33/0.46 % Clauses deleted for lack of memory : 0
% 0.33/0.46 % Backward-subsumed : 1
% 0.33/0.46 % Backward-rewritten : 2
% 0.33/0.46 % Generated clauses : 1295
% 0.33/0.46 % ...of the previous two non-redundant : 1081
% 0.33/0.46 % ...aggressively subsumed : 0
% 0.33/0.46 % Contextual simplify-reflections : 0
% 0.33/0.46 % Paramodulations : 1295
% 0.33/0.46 % Factorizations : 0
% 0.33/0.46 % NegExts : 0
% 0.33/0.46 % Equation resolutions : 0
% 0.33/0.46 % Disequality decompositions : 0
% 0.33/0.46 % Total rewrite steps : 223
% 0.33/0.46 % ...of those cached : 135
% 0.33/0.46 % Propositional unsat checks : 0
% 0.33/0.46 % Propositional check models : 0
% 0.33/0.46 % Propositional check unsatisfiable : 0
% 0.33/0.46 % Propositional clauses : 0
% 0.33/0.46 % Propositional clauses after purity: 0
% 0.33/0.46 % Propositional unsat core size : 0
% 0.33/0.46 % Propositional preprocessing time : 0.000
% 0.33/0.46 % Propositional encoding time : 0.000
% 0.33/0.46 % Propositional solver time : 0.000
% 0.33/0.46 % Success case prop preproc time : 0.000
% 0.33/0.46 % Success case prop encoding time : 0.000
% 0.33/0.46 % Success case prop solver time : 0.000
% 0.33/0.46 % Current number of processed clauses : 258
% 0.33/0.46 % Positive orientable unit clauses : 91
% 0.33/0.46 % Positive unorientable unit clauses: 0
% 0.33/0.46 % Negative unit clauses : 1
% 0.33/0.46 % Non-unit-clauses : 166
% 0.33/0.46 % Current number of unprocessed clauses: 790
% 0.33/0.46 % ...number of literals in the above : 1412
% 0.33/0.46 % Current number of archived formulas : 0
% 0.33/0.46 % Current number of archived clauses : 13
% 0.33/0.46 % Clause-clause subsumption calls (NU) : 3294
% 0.33/0.46 % Rec. Clause-clause subsumption calls : 2911
% 0.33/0.46 % Non-unit clause-clause subsumptions : 29
% 0.33/0.46 % Unit Clause-clause subsumption calls : 3
% 0.33/0.46 % Rewrite failures with RHS unbound : 0
% 0.33/0.46 % BW rewrite match attempts : 72
% 0.33/0.46 % BW rewrite match successes : 2
% 0.33/0.46 % Condensation attempts : 0
% 0.33/0.46 % Condensation successes : 0
% 0.33/0.46 % Termbank termtop insertions : 15573
% 0.33/0.46 % Search garbage collected termcells : 24
% 0.33/0.46
% 0.33/0.46 % -------------------------------------------------
% 0.33/0.46 % User time : 0.027 s
% 0.33/0.46 % System time : 0.005 s
% 0.33/0.46 % Total time : 0.032 s
% 0.33/0.46 % Maximum resident set size: 3640 pages
% 0.33/0.46
% 0.33/0.46 % -------------------------------------------------
% 0.33/0.46 % User time : 0.182 s
% 0.33/0.46 % System time : 0.044 s
% 0.33/0.46 % Total time : 0.226 s
% 0.33/0.46 % Maximum resident set size: 4608 pages
% 0.33/0.46 % E exiting
%------------------------------------------------------------------------------