TSTP Solution File: GRP039-7 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP039-7 : TPTP v8.1.2. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:43:35 EDT 2023
% Result : Unsatisfiable 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 31 unt; 5 nHn; 25 RR)
% Number of literals : 68 ( 28 equ; 20 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/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',left_identity) ).
cnf(right_inverse,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',right_inverse) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
multiply(b,inverse(a)) = c,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.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/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',closure_of_multiply) ).
cnf(inverse_inverse,axiom,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',inverse_inverse) ).
cnf(b_in_O2,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',b_in_O2) ).
cnf(a_times_c_is_d,negated_conjecture,
multiply(a,c) = d,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',a_times_c_is_d) ).
cnf(prove_d_in_O2,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',prove_d_in_O2) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',right_identity) ).
cnf(closure_of_inverse,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',closure_of_inverse) ).
cnf(property_of_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| multiply(X1,element_in_O2(X1,X2)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.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/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p',an_element_in_O2) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,axiom,
multiply(X1,inverse(X1)) = identity,
right_inverse ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
multiply(b,inverse(a)) = c,
b_times_a_inverse_is_c ).
cnf(c_0_20,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| multiply(X1,X2) != X3 ),
closure_of_multiply ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
multiply(inverse(b),c) = inverse(a),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
inverse(inverse(X1)) = X1,
inverse_inverse ).
cnf(c_0_24,plain,
( subgroup_member(multiply(X1,X2))
| ~ subgroup_member(X2)
| ~ subgroup_member(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
subgroup_member(b),
b_in_O2 ).
cnf(c_0_26,negated_conjecture,
multiply(a,c) = d,
a_times_c_is_d ).
cnf(c_0_27,negated_conjecture,
~ subgroup_member(d),
prove_d_in_O2 ).
cnf(c_0_28,negated_conjecture,
multiply(inverse(b),multiply(c,a)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_30,negated_conjecture,
( subgroup_member(c)
| ~ subgroup_member(inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_25])]) ).
cnf(c_0_31,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
closure_of_inverse ).
cnf(c_0_32,negated_conjecture,
( ~ subgroup_member(c)
| ~ subgroup_member(a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_26]),c_0_27]) ).
cnf(c_0_33,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| multiply(X1,element_in_O2(X1,X2)) = X2 ),
property_of_O2 ).
cnf(c_0_34,plain,
( subgroup_member(X1)
| ~ subgroup_member(multiply(X2,X1))
| ~ subgroup_member(inverse(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
multiply(c,a) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_28]),c_0_23]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
multiply(inverse(a),d) = c,
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_38,plain,
( multiply(inverse(X1),X2) = element_in_O2(X1,X2)
| subgroup_member(X1)
| subgroup_member(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
~ subgroup_member(inverse(c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25])]),c_0_36]) ).
cnf(c_0_40,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
an_element_in_O2 ).
cnf(c_0_41,negated_conjecture,
element_in_O2(a,d) = c,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_36]),c_0_27]) ).
cnf(c_0_42,negated_conjecture,
~ subgroup_member(c),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_27]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP039-7 : TPTP v8.1.2. Bugfixed v1.0.1.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Oct 3 02:37:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.7C88TRdy76/E---3.1_24456.p
% 0.20/0.48 # Version: 3.1pre001
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # sh5l with pid 24579 completed with status 0
% 0.20/0.48 # Result found by sh5l
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 0.20/0.48 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 24584 completed with status 0
% 0.20/0.48 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 0.20/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 # Starting sh5l with 300s (1) cores
% 0.20/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.20/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Unsatisfiable
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 16
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 16
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 16
% 0.20/0.48 # Processed clauses : 172
% 0.20/0.48 # ...of these trivial : 1
% 0.20/0.48 # ...subsumed : 80
% 0.20/0.48 # ...remaining for further processing : 91
% 0.20/0.48 # Other redundant clauses eliminated : 1
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 4
% 0.20/0.48 # Backward-rewritten : 5
% 0.20/0.48 # Generated clauses : 647
% 0.20/0.48 # ...of the previous two non-redundant : 453
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 1
% 0.20/0.48 # Paramodulations : 646
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 1
% 0.20/0.48 # Total rewrite steps : 549
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 65
% 0.20/0.48 # Positive orientable unit clauses : 35
% 0.20/0.48 # Positive unorientable unit clauses: 0
% 0.20/0.48 # Negative unit clauses : 9
% 0.20/0.48 # Non-unit-clauses : 21
% 0.20/0.48 # Current number of unprocessed clauses: 310
% 0.20/0.48 # ...number of literals in the above : 736
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 25
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 163
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 151
% 0.20/0.48 # Non-unit clause-clause subsumptions : 8
% 0.20/0.48 # Unit Clause-clause subsumption calls : 82
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 7
% 0.20/0.48 # BW rewrite match successes : 4
% 0.20/0.48 # Condensation attempts : 0
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 6903
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.008 s
% 0.20/0.48 # System time : 0.001 s
% 0.20/0.48 # Total time : 0.009 s
% 0.20/0.48 # Maximum resident set size: 1644 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.010 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.012 s
% 0.20/0.48 # Maximum resident set size: 1680 pages
% 0.20/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------