%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP034-3 : 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 : n015.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.24s 0.52s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 12 RR)
% Number of literals : 27 ( 0 equ; 14 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 : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 15 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(closure_of_product_and_inverse,axiom,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-2.ax',closure_of_product_and_inverse) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(a_is_in_subgroup,hypothesis,
subgroup_member(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_in_subgroup) ).
cnf(prove_a_inverse_is_in_subgroup,negated_conjecture,
~ subgroup_member(inverse(a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_inverse_is_in_subgroup) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(c_0_5,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_6,plain,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
c_0_5 ).
cnf(c_0_7,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_8,plain,
( ~ subgroup_member(X1)
| subgroup_member(identity) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,hypothesis,
subgroup_member(a),
a_is_in_subgroup ).
cnf(c_0_10,negated_conjecture,
~ subgroup_member(inverse(a)),
inference(fof_simplification,[status(thm)],[prove_a_inverse_is_in_subgroup]) ).
cnf(c_0_11,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_12,hypothesis,
subgroup_member(identity),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ subgroup_member(inverse(a)),
c_0_10 ).
cnf(c_0_14,plain,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP034-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n015.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 20 19:58:35 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.24/0.52 % Version: 3.5.1
% 0.24/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.52 % Starting sh5l with 300s (1) cores
% 0.24/0.52 % new_bool_3 with pid 3793947 completed with status 0
% 0.24/0.52 % Result found by new_bool_3
% 0.24/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.52 % Search class: FHUSM-FFSF11-SFFFFFNN
% 0.24/0.52 % partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.24/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.52 % SubtermCWHack with pid 3793950 completed with status 0
% 0.24/0.52 % Result found by SubtermCWHack
% 0.24/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.52 % Search class: FHUSM-FFSF11-SFFFFFNN
% 0.24/0.52 % partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.24/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.52 % Preprocessing time : 0.001 s
% 0.24/0.52
% 0.24/0.52 % Proof found!
% 0.24/0.52 % SZS status Unsatisfiable
% 0.24/0.52 % SZS output start CNFRefutation
% See solution above
% 0.24/0.52 % Parsed axioms : 11
% 0.24/0.52 % Removed by relevancy pruning/SinE : 1
% 0.24/0.52 % Initial clauses : 10
% 0.24/0.52 % Removed in clause preprocessing : 0
% 0.24/0.52 % Initial clauses in saturation : 10
% 0.24/0.52 % Processed clauses : 10
% 0.24/0.52 % ...of these trivial : 0
% 0.24/0.52 % ...subsumed : 0
% 0.24/0.52 % ...remaining for further processing : 10
% 0.24/0.52 % Other redundant clauses eliminated : 0
% 0.24/0.52 % Clauses deleted for lack of memory : 0
% 0.24/0.52 % Backward-subsumed : 0
% 0.24/0.52 % Backward-rewritten : 1
% 0.24/0.52 % Generated clauses : 5
% 0.24/0.52 % ...of the previous two non-redundant : 4
% 0.24/0.52 % ...aggressively subsumed : 0
% 0.24/0.52 % Contextual simplify-reflections : 0
% 0.24/0.52 % Paramodulations : 5
% 0.24/0.52 % Factorizations : 0
% 0.24/0.52 % NegExts : 0
% 0.24/0.52 % Equation resolutions : 0
% 0.24/0.52 % Disequality decompositions : 0
% 0.24/0.52 % Total rewrite steps : 3
% 0.24/0.52 % ...of those cached : 1
% 0.24/0.52 % Propositional unsat checks : 0
% 0.24/0.52 % Propositional check models : 0
% 0.24/0.52 % Propositional check unsatisfiable : 0
% 0.24/0.52 % Propositional clauses : 0
% 0.24/0.52 % Propositional clauses after purity: 0
% 0.24/0.52 % Propositional unsat core size : 0
% 0.24/0.52 % Propositional preprocessing time : 0.000
% 0.24/0.52 % Propositional encoding time : 0.000
% 0.24/0.52 % Propositional solver time : 0.000
% 0.24/0.52 % Success case prop preproc time : 0.000
% 0.24/0.52 % Success case prop encoding time : 0.000
% 0.24/0.52 % Success case prop solver time : 0.000
% 0.24/0.52 % Current number of processed clauses : 9
% 0.24/0.52 % Positive orientable unit clauses : 6
% 0.24/0.52 % Positive unorientable unit clauses: 0
% 0.24/0.52 % Negative unit clauses : 1
% 0.24/0.52 % Non-unit-clauses : 2
% 0.24/0.52 % Current number of unprocessed clauses: 4
% 0.24/0.52 % ...number of literals in the above : 14
% 0.24/0.52 % Current number of archived formulas : 0
% 0.24/0.52 % Current number of archived clauses : 1
% 0.24/0.52 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.52 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.52 % Non-unit clause-clause subsumptions : 0
% 0.24/0.52 % Unit Clause-clause subsumption calls : 0
% 0.24/0.52 % Rewrite failures with RHS unbound : 0
% 0.24/0.52 % BW rewrite match attempts : 1
% 0.24/0.52 % BW rewrite match successes : 1
% 0.24/0.52 % Condensation attempts : 0
% 0.24/0.52 % Condensation successes : 0
% 0.24/0.52 % Termbank termtop insertions : 304
% 0.24/0.52 % Search garbage collected termcells : 30
% 0.24/0.52
% 0.24/0.52 % -------------------------------------------------
% 0.24/0.52 % User time : 0.001 s
% 0.24/0.52 % System time : 0.003 s
% 0.24/0.52 % Total time : 0.004 s
% 0.24/0.52 % Maximum resident set size: 3644 pages
% 0.24/0.52
% 0.24/0.52 % -------------------------------------------------
% 0.24/0.52 % User time : 0.002 s
% 0.24/0.52 % System time : 0.007 s
% 0.24/0.52 % Total time : 0.009 s
% 0.24/0.52 % Maximum resident set size: 4608 pages
% 0.24/0.52 % E exiting
%------------------------------------------------------------------------------