TSTP Solution File: GRP039-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP039-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:36:12 EDT 2023
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 28 unt; 8 nHn; 22 RR)
% Number of literals : 68 ( 28 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',associativity) ).
cnf(a_times_c_is_d,negated_conjecture,
multiply(a,c) = d,
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',a_times_c_is_d) ).
cnf(property_of_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| multiply(X1,element_in_O2(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',property_of_O2) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
multiply(b,inverse(a)) = c,
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',b_times_a_inverse_is_c) ).
cnf(closure_of_multiply,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| multiply(X1,X2) != X3 ),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',closure_of_multiply) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',left_identity) ).
cnf(prove_d_in_O2,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',prove_d_in_O2) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',right_identity) ).
cnf(b_in_O2,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',b_in_O2) ).
cnf(right_inverse,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',right_inverse) ).
cnf(closure_of_inverse,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',closure_of_inverse) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p',an_element_in_O2) ).
cnf(c_0_13,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_14,negated_conjecture,
multiply(a,c) = d,
a_times_c_is_d ).
cnf(c_0_15,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| multiply(X1,element_in_O2(X1,X2)) = X2 ),
property_of_O2 ).
cnf(c_0_16,negated_conjecture,
multiply(b,inverse(a)) = c,
b_times_a_inverse_is_c ).
cnf(c_0_17,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| multiply(X1,X2) != X3 ),
closure_of_multiply ).
cnf(c_0_18,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_19,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_20,negated_conjecture,
multiply(a,multiply(c,X1)) = multiply(d,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( multiply(X1,multiply(X2,element_in_O2(multiply(X1,X2),X3))) = X3
| subgroup_member(multiply(X1,X2))
| subgroup_member(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ subgroup_member(d),
prove_d_in_O2 ).
cnf(c_0_23,negated_conjecture,
multiply(b,multiply(inverse(a),X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_24,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_25,plain,
( subgroup_member(multiply(X1,X2))
| ~ subgroup_member(X2)
| ~ subgroup_member(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
subgroup_member(b),
b_in_O2 ).
cnf(c_0_27,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( multiply(d,element_in_O2(d,X1)) = X1
| subgroup_member(X1) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_14]),c_0_14]),c_0_22]) ).
cnf(c_0_29,axiom,
multiply(X1,inverse(X1)) = identity,
right_inverse ).
cnf(c_0_30,negated_conjecture,
multiply(c,a) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( subgroup_member(c)
| ~ subgroup_member(inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26])]) ).
cnf(c_0_32,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
closure_of_inverse ).
cnf(c_0_33,negated_conjecture,
( ~ subgroup_member(c)
| ~ subgroup_member(a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_22]) ).
cnf(c_0_34,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
an_element_in_O2 ).
cnf(c_0_35,negated_conjecture,
( element_in_O2(d,X1) = multiply(inverse(d),X1)
| subgroup_member(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
multiply(d,inverse(c)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_24]) ).
cnf(c_0_37,negated_conjecture,
multiply(inverse(c),b) = a,
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( subgroup_member(multiply(inverse(d),X1))
| subgroup_member(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_22]) ).
cnf(c_0_40,negated_conjecture,
multiply(inverse(d),a) = inverse(c),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ subgroup_member(inverse(c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_37]),c_0_26])]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP039-2 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 03:26:52 EDT 2023
% 0.10/0.31 % CPUTime :
% 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/tmp/tmp.x2JoqNjdxk/E---3.1_26566.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26644 completed with status 0
% 0.15/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.43 # Starting sh5l with 136s (1) cores
% 0.15/0.43 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 26649 completed with status 0
% 0.15/0.43 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.43 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.15/0.43 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 13
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 13
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 13
% 0.15/0.43 # Processed clauses : 105
% 0.15/0.43 # ...of these trivial : 6
% 0.15/0.43 # ...subsumed : 33
% 0.15/0.43 # ...remaining for further processing : 66
% 0.15/0.43 # Other redundant clauses eliminated : 16
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 9
% 0.15/0.43 # Backward-rewritten : 1
% 0.15/0.43 # Generated clauses : 557
% 0.15/0.43 # ...of the previous two non-redundant : 375
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 3
% 0.15/0.43 # Paramodulations : 537
% 0.15/0.43 # Factorizations : 2
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 18
% 0.15/0.43 # Total rewrite steps : 439
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 56
% 0.15/0.43 # Positive orientable unit clauses : 26
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 10
% 0.15/0.43 # Non-unit-clauses : 20
% 0.15/0.43 # Current number of unprocessed clauses: 264
% 0.15/0.43 # ...number of literals in the above : 688
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 10
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 193
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 137
% 0.15/0.43 # Non-unit clause-clause subsumptions : 12
% 0.15/0.43 # Unit Clause-clause subsumption calls : 102
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 4
% 0.15/0.43 # BW rewrite match successes : 1
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 5790
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.011 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.012 s
% 0.15/0.43 # Maximum resident set size: 1600 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.050 s
% 0.15/0.43 # System time : 0.008 s
% 0.15/0.43 # Total time : 0.057 s
% 0.15/0.43 # Maximum resident set size: 1680 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------