%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP017-1 : 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 : n006.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:22 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 13 unt; 0 nHn; 18 RR)
% Number of literals : 41 ( 7 equ; 22 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 41 ( 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/GRP003-0.ax',associativity2) ).
cnf(a_times_c_is_identity,hypothesis,
product(a,c,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c_is_identity) ).
cnf(total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(b_times_a_is_identity,hypothesis,
product(b,a,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_is_identity) ).
cnf(prove_b_equals_c,negated_conjecture,
b != c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_equals_c) ).
cnf(c_0_7,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_8,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
c_0_7 ).
cnf(c_0_9,hypothesis,
product(a,c,identity),
a_times_c_is_identity ).
cnf(c_0_10,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_11,hypothesis,
( ~ product(X3,a,X1)
| ~ product(X3,identity,X2)
| product(X1,c,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_13,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_10 ).
cnf(c_0_14,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_15,hypothesis,
( ~ product(X2,a,X1)
| product(X1,c,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
product(b,a,identity),
b_times_a_is_identity ).
cnf(c_0_17,negated_conjecture,
b != c,
inference(fof_simplification,[status(thm)],[prove_b_equals_c]) ).
cnf(c_0_18,plain,
( ~ product(identity,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
product(identity,c,b),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
b != c,
c_0_17 ).
cnf(c_0_21,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP017-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n006.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 19:53:42 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % new_bool_3 with pid 1124570 completed with status 0
% 0.12/0.42 % Result found by new_bool_3
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FHUSS-FFSS00-SFFFFFNN
% 0.12/0.42 % partial match(2): FHUNF-FFSS00-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % SubtermCWHack with pid 1124578 completed with status 0
% 0.12/0.42 % Result found by SubtermCWHack
% 0.12/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.42 % Search class: FHUSS-FFSS00-SFFFFFNN
% 0.12/0.42 % partial match(2): FHUNF-FFSS00-SFFFFFNN
% 0.12/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Unsatisfiable
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 13
% 0.12/0.42 % Removed by relevancy pruning/SinE : 3
% 0.12/0.42 % Initial clauses : 10
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 10
% 0.12/0.42 % Processed clauses : 26
% 0.12/0.42 % ...of these trivial : 0
% 0.12/0.42 % ...subsumed : 0
% 0.12/0.42 % ...remaining for further processing : 26
% 0.12/0.42 % Other redundant clauses eliminated : 0
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 3
% 0.12/0.42 % Backward-rewritten : 0
% 0.12/0.42 % Generated clauses : 39
% 0.12/0.42 % ...of the previous two non-redundant : 28
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 0
% 0.12/0.42 % Paramodulations : 39
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 0
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 10
% 0.12/0.42 % ...of those cached : 5
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 23
% 0.12/0.42 % Positive orientable unit clauses : 7
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 1
% 0.12/0.42 % Non-unit-clauses : 15
% 0.12/0.42 % Current number of unprocessed clauses: 9
% 0.12/0.42 % ...number of literals in the above : 27
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 3
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 83
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 77
% 0.12/0.42 % Non-unit clause-clause subsumptions : 3
% 0.12/0.42 % Unit Clause-clause subsumption calls : 0
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 0
% 0.12/0.42 % BW rewrite match successes : 0
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 710
% 0.12/0.42 % Search garbage collected termcells : 26
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.005 s
% 0.12/0.42 % System time : 0.000 s
% 0.12/0.42 % Total time : 0.005 s
% 0.12/0.42 % Maximum resident set size: 3640 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.007 s
% 0.12/0.42 % System time : 0.004 s
% 0.12/0.42 % Total time : 0.012 s
% 0.12/0.42 % Maximum resident set size: 4864 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------