TSTP Solution File: GRP039-5 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP039-5 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:51:36 EDT 2024
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 55 ( 34 unt; 6 nHn; 32 RR)
% Number of literals : 91 ( 28 equ; 34 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 : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(closure_of_multiply,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| multiply(X1,X2) != X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-1.ax',closure_of_multiply) ).
cnf(prove_d_in_O2,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_in_O2) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
multiply(b,inverse(a)) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_inverse_is_c) ).
cnf(b_in_O2,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_in_O2) ).
cnf(closure_of_inverse,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-1.ax',closure_of_inverse) ).
cnf(a_times_c_is_d,negated_conjecture,
multiply(a,c) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c_is_d) ).
cnf(right_inverse,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(property_of_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| multiply(X1,element_in_O2(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_O2) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_element_in_O2) ).
cnf(identity_in_O2,axiom,
subgroup_member(identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity_in_O2) ).
cnf(c_0_14,plain,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| multiply(X1,X2) != X3 ),
inference(fof_simplification,[status(thm)],[closure_of_multiply]) ).
cnf(c_0_15,plain,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| multiply(X1,X2) != X3 ),
c_0_14 ).
cnf(c_0_16,negated_conjecture,
~ subgroup_member(d),
inference(fof_simplification,[status(thm)],[prove_d_in_O2]) ).
cnf(c_0_17,plain,
( subgroup_member(multiply(X1,X2))
| ~ subgroup_member(X2)
| ~ subgroup_member(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_18,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_19,negated_conjecture,
multiply(b,inverse(a)) = c,
b_times_a_inverse_is_c ).
cnf(c_0_20,negated_conjecture,
subgroup_member(b),
b_in_O2 ).
cnf(c_0_21,plain,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
inference(fof_simplification,[status(thm)],[closure_of_inverse]) ).
cnf(c_0_22,negated_conjecture,
multiply(a,c) = d,
a_times_c_is_d ).
cnf(c_0_23,negated_conjecture,
~ subgroup_member(d),
c_0_16 ).
cnf(c_0_24,plain,
( subgroup_member(multiply(X1,multiply(X2,X3)))
| ~ subgroup_member(multiply(X1,X2))
| ~ subgroup_member(X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,axiom,
multiply(X1,inverse(X1)) = identity,
right_inverse ).
cnf(c_0_26,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_27,negated_conjecture,
( subgroup_member(c)
| ~ subgroup_member(inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_20])]) ).
cnf(c_0_28,plain,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
c_0_21 ).
cnf(c_0_29,negated_conjecture,
( ~ subgroup_member(c)
| ~ subgroup_member(a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_22]),c_0_23]) ).
cnf(c_0_30,plain,
( subgroup_member(X1)
| ~ subgroup_member(multiply(X1,X2))
| ~ subgroup_member(inverse(X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
multiply(a,multiply(c,X1)) = multiply(d,X1),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( ~ subgroup_member(inverse(multiply(c,X1)))
| ~ subgroup_member(multiply(d,X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_34,negated_conjecture,
multiply(d,inverse(c)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_26]) ).
cnf(c_0_35,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_36,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_37,negated_conjecture,
( ~ subgroup_member(multiply(d,X1))
| ~ subgroup_member(multiply(c,X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_38,negated_conjecture,
multiply(d,multiply(inverse(c),X1)) = multiply(a,X1),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_39,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_25]),c_0_35]) ).
cnf(c_0_40,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| multiply(X1,element_in_O2(X1,X2)) = X2 ),
property_of_O2 ).
cnf(c_0_41,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
an_element_in_O2 ).
cnf(c_0_42,negated_conjecture,
multiply(b,multiply(inverse(a),X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_43,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_36]),c_0_35]) ).
cnf(c_0_44,negated_conjecture,
( ~ subgroup_member(multiply(a,X1))
| ~ subgroup_member(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_45,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_46,axiom,
subgroup_member(identity),
identity_in_O2 ).
cnf(c_0_47,plain,
( subgroup_member(multiply(X1,X2))
| subgroup_member(X3)
| subgroup_member(X2)
| ~ subgroup_member(multiply(X1,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_40]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
multiply(c,a) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_26]) ).
cnf(c_0_49,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_26]) ).
cnf(c_0_50,negated_conjecture,
~ subgroup_member(multiply(X1,inverse(multiply(a,X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_51,negated_conjecture,
( subgroup_member(multiply(c,X1))
| subgroup_member(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_20])]),c_0_32]) ).
cnf(c_0_52,plain,
( subgroup_member(X1)
| ~ subgroup_member(inverse(X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
subgroup_member(inverse(d)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_22]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP039-5 : TPTP v8.2.0. Released v1.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 05:15:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 16816 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 0.20/0.49 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 16824 completed with status 0
% 0.20/0.49 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Unsatisfiable
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 14
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 14
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 14
% 0.20/0.49 # Processed clauses : 395
% 0.20/0.49 # ...of these trivial : 16
% 0.20/0.49 # ...subsumed : 241
% 0.20/0.49 # ...remaining for further processing : 138
% 0.20/0.49 # Other redundant clauses eliminated : 1
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 5
% 0.20/0.49 # Backward-rewritten : 13
% 0.20/0.49 # Generated clauses : 1436
% 0.20/0.49 # ...of the previous two non-redundant : 1098
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 1435
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 1
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 1294
% 0.20/0.49 # ...of those cached : 948
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 105
% 0.20/0.49 # Positive orientable unit clauses : 43
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 16
% 0.20/0.49 # Non-unit-clauses : 46
% 0.20/0.49 # Current number of unprocessed clauses: 712
% 0.20/0.49 # ...number of literals in the above : 1741
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 32
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 1105
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 939
% 0.20/0.49 # Non-unit clause-clause subsumptions : 55
% 0.20/0.49 # Unit Clause-clause subsumption calls : 212
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 14
% 0.20/0.49 # BW rewrite match successes : 9
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 16954
% 0.20/0.49 # Search garbage collected termcells : 10
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.021 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.024 s
% 0.20/0.49 # Maximum resident set size: 1620 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.023 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.027 s
% 0.20/0.49 # Maximum resident set size: 1704 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------