%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP033-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 12:37:31 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 32 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 19 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_subgr2,negated_conjecture,
( ~ subgroup_member(X1)
| ~ product(X1,j(X1),j(X1))
| ~ product(j(X1),X1,j(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subgr2) ).
cnf(closure_of_product_and_inverse,axiom,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-2.ax',closure_of_product_and_inverse) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(a_is_in_subgroup,hypothesis,
subgroup_member(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_in_subgroup) ).
cnf(c_0_6,negated_conjecture,
( ~ subgroup_member(X1)
| ~ product(X1,j(X1),j(X1))
| ~ product(j(X1),X1,j(X1)) ),
inference(fof_simplification,[status(thm)],[prove_subgr2]) ).
cnf(c_0_7,plain,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
inference(fof_simplification,[status(thm)],[closure_of_product_and_inverse]) ).
cnf(c_0_8,negated_conjecture,
( ~ subgroup_member(X1)
| ~ product(X1,j(X1),j(X1))
| ~ product(j(X1),X1,j(X1)) ),
c_0_6 ).
cnf(c_0_9,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_10,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_11,plain,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
c_0_7 ).
cnf(c_0_12,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_13,negated_conjecture,
~ subgroup_member(identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,hypothesis,
subgroup_member(a),
a_is_in_subgroup ).
cnf(c_0_15,plain,
~ subgroup_member(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP033-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3377043 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FHHSM-FFSF21-SFFFFFNN
% 0.10/0.44 % partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3377048 completed with status 0
% 0.10/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FHHSM-FFSF21-SFFFFFNN
% 0.10/0.44 % partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44 % Presaturation interreduction done
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 12
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 12
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 12
% 0.10/0.44 % Processed clauses : 25
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 0
% 0.10/0.44 % ...remaining for further processing : 25
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 4
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 16
% 0.10/0.44 % ...of the previous two non-redundant : 15
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 15
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 1
% 0.10/0.44 % ...of those cached : 0
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 8
% 0.10/0.44 % Positive orientable unit clauses : 5
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 2
% 0.10/0.44 % Current number of unprocessed clauses: 14
% 0.10/0.44 % ...number of literals in the above : 38
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 17
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 14
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 11
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 7
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 9
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 577
% 0.10/0.44 % Search garbage collected termcells : 32
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.002 s
% 0.10/0.44 % System time : 0.004 s
% 0.10/0.44 % Total time : 0.006 s
% 0.10/0.44 % Maximum resident set size: 3644 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.010 s
% 0.10/0.44 % System time : 0.011 s
% 0.10/0.44 % Total time : 0.021 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------