%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP123-7.003 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:52 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 26 unt; 8 nHn; 46 RR)
% Number of literals : 99 ( 0 equ; 48 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product1_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_total_function1) ).
cnf(product1_left_cancellation,axiom,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_left_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(product1_right_cancellation,axiom,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_right_cancellation) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_idempotence) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(product2_total_function2,axiom,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_total_function2) ).
cnf(qg1a,negated_conjecture,
( ~ product1(X3,X2,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg1a) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_idempotence) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(c_0_14,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product1_total_function1]) ).
cnf(c_0_15,plain,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product1_left_cancellation]) ).
cnf(c_0_16,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
c_0_14 ).
cnf(c_0_17,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_18,plain,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product1_right_cancellation]) ).
cnf(c_0_19,plain,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
c_0_15 ).
cnf(c_0_20,axiom,
product1(X1,X1,X1),
product1_idempotence ).
cnf(c_0_21,plain,
( ~ group_element(X1)
| product1(X1,e_3,e_3)
| product1(X1,e_3,e_2)
| product1(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_23,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_24,plain,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
c_0_18 ).
cnf(c_0_25,plain,
( ~ product1(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( product1(e_1,e_3,e_1)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
~ equalish(e_1,e_3),
c_0_23 ).
cnf(c_0_28,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_29,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product2_total_function2]) ).
cnf(c_0_30,negated_conjecture,
( ~ product1(X3,X2,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[qg1a]) ).
cnf(c_0_31,plain,
( ~ product1(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_32,plain,
( product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
~ equalish(e_3,e_1),
c_0_28 ).
cnf(c_0_34,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_35,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_36,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
c_0_29 ).
cnf(c_0_37,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_38,negated_conjecture,
( ~ product1(X3,X2,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X1,X2) ),
c_0_30 ).
cnf(c_0_39,plain,
product1(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_40,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_41,plain,
( product1(e_2,e_3,e_1)
| product1(e_2,e_3,e_2)
| product1(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_42,plain,
~ equalish(e_2,e_3),
c_0_35 ).
cnf(c_0_43,plain,
( ~ product2(X2,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( ~ product1(X1,e_3,e_1)
| product2(e_2,X1,e_3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
~ equalish(e_3,e_2),
c_0_40 ).
cnf(c_0_46,plain,
( product1(e_2,e_3,e_2)
| product1(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
~ product1(e_2,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,plain,
product1(e_2,e_3,e_2),
inference(sr,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_48]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP123-7.003 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n011.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 19:58:25 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 36936 completed with status 0
% 0.12/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FGHNS-FFSM00-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHNF-FFSM00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 36940 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FGHNS-FFSM00-SFFFFFNN
% 0.12/0.44 % partial match(1): FGHNF-FFSM00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 26
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 26
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 26
% 0.12/0.44 % Processed clauses : 58
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 2
% 0.12/0.44 % ...remaining for further processing : 56
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 2
% 0.12/0.44 % Backward-rewritten : 4
% 0.12/0.44 % Generated clauses : 87
% 0.12/0.44 % ...of the previous two non-redundant : 62
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 86
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 29
% 0.12/0.44 % ...of those cached : 19
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 49
% 0.12/0.44 % Positive orientable unit clauses : 13
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 8
% 0.12/0.44 % Non-unit-clauses : 28
% 0.12/0.44 % Current number of unprocessed clauses: 25
% 0.12/0.44 % ...number of literals in the above : 84
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 7
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 175
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 170
% 0.12/0.44 % Non-unit clause-clause subsumptions : 4
% 0.12/0.44 % Unit Clause-clause subsumption calls : 11
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 12
% 0.12/0.44 % BW rewrite match successes : 2
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 1618
% 0.12/0.44 % Search garbage collected termcells : 60
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.003 s
% 0.12/0.44 % System time : 0.004 s
% 0.12/0.44 % Total time : 0.007 s
% 0.12/0.44 % Maximum resident set size: 3644 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.013 s
% 0.12/0.44 % System time : 0.014 s
% 0.12/0.44 % Total time : 0.027 s
% 0.12/0.44 % Maximum resident set size: 4608 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------