TSTP Solution File: GRP039-4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP039-4 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of clauses : 66 ( 32 unt; 4 nHn; 49 RR)
% Number of literals : 131 ( 13 equ; 62 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 113 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity1) ).
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity2) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(total_function2,axiom,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(a_times_c_is_d,negated_conjecture,
product(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c_is_d) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(right_identity,axiom,
product(X1,identity,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(closure_of_product,axiom,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-1.ax',closure_of_product) ).
cnf(prove_d_is_in_subgroup,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_is_in_subgroup) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
product(b,inverse(a),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_inverse_is_c) ).
cnf(b_is_in_subgroup,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_in_subgroup) ).
cnf(closure_of_inverse,axiom,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-1.ax',closure_of_inverse) ).
cnf(property_of_O2,axiom,
( product(X1,element_in_O2(X1,X2),X2)
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_O2) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_element_in_O2) ).
cnf(c_0_16,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity1]) ).
cnf(c_0_17,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_18,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
c_0_16 ).
cnf(c_0_19,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_20,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_21,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
product(a,c,d),
a_times_c_is_d ).
cnf(c_0_23,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_25,plain,
( X3 = X4
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
c_0_20 ).
cnf(c_0_26,axiom,
product(X1,identity,X1),
right_identity ).
cnf(c_0_27,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_28,negated_conjecture,
( product(X1,c,X2)
| ~ product(X3,d,X2)
| ~ product(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_30,plain,
( product(X1,X2,X3)
| ~ product(inverse(X1),X3,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ product(X2,identity,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( product(inverse(X1),X2,X3)
| ~ product(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( product(X1,c,identity)
| ~ product(inverse(d),a,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,plain,
( X1 = multiply(X2,X3)
| ~ product(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_35,plain,
product(X1,identity,inverse(inverse(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,plain,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_37,plain,
( X1 = inverse(X2)
| ~ product(X2,X1,identity) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
product(multiply(inverse(d),a),c,identity),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_39,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
inverse(multiply(inverse(d),a)) = c,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
multiply(inverse(d),a) = inverse(c),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[closure_of_product]) ).
cnf(c_0_43,negated_conjecture,
~ subgroup_member(d),
inference(fof_simplification,[status(thm)],[prove_d_is_in_subgroup]) ).
cnf(c_0_44,negated_conjecture,
product(inverse(d),a,inverse(c)),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_45,plain,
( subgroup_member(X3)
| ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ product(X1,X2,X3) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
product(b,inverse(a),c),
b_times_a_inverse_is_c ).
cnf(c_0_47,negated_conjecture,
subgroup_member(b),
b_is_in_subgroup ).
cnf(c_0_48,plain,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
inference(fof_simplification,[status(thm)],[closure_of_inverse]) ).
cnf(c_0_49,negated_conjecture,
~ subgroup_member(d),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
( X1 = inverse(c)
| ~ product(inverse(d),a,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( subgroup_member(c)
| ~ subgroup_member(inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_52,plain,
( subgroup_member(inverse(X1))
| ~ subgroup_member(X1) ),
c_0_48 ).
cnf(c_0_53,negated_conjecture,
( ~ subgroup_member(c)
| ~ subgroup_member(a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_22]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( X1 = inverse(c)
| ~ product(d,X1,a) ),
inference(spm,[status(thm)],[c_0_50,c_0_32]) ).
cnf(c_0_55,axiom,
( product(X1,element_in_O2(X1,X2),X2)
| subgroup_member(X2)
| subgroup_member(X1) ),
property_of_O2 ).
cnf(c_0_56,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_57,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
an_element_in_O2 ).
cnf(c_0_58,negated_conjecture,
element_in_O2(d,a) = inverse(c),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_49]) ).
cnf(c_0_59,plain,
( subgroup_member(X1)
| ~ subgroup_member(inverse(X2))
| ~ subgroup_member(X3)
| ~ product(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_60,plain,
( subgroup_member(X1)
| ~ subgroup_member(inverse(X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_61,negated_conjecture,
subgroup_member(inverse(c)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_56]),c_0_49]) ).
cnf(c_0_62,plain,
( subgroup_member(X1)
| ~ subgroup_member(X2)
| ~ subgroup_member(X3)
| ~ product(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_52]) ).
cnf(c_0_63,negated_conjecture,
subgroup_member(c),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
subgroup_member(inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_46]),c_0_63]),c_0_47])]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_64]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GRP039-4 : TPTP v8.2.0. Released v1.0.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n010.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 05:00:53 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.14/0.42 # Version: 3.1.0
% 0.14/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 # Starting sh5l with 300s (1) cores
% 0.14/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11413 completed with status 0
% 0.14/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 # No SInE strategy applied
% 0.14/0.42 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.14/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 # Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 # Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 # Starting sh5l with 136s (1) cores
% 0.14/0.42 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11418 completed with status 0
% 0.14/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.42 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.42 # No SInE strategy applied
% 0.14/0.42 # Search class: FGUSM-FFSS21-SFFFFFNN
% 0.14/0.42 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 0.14/0.42 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.42 # Preprocessing time : 0.001 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Unsatisfiable
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 17
% 0.14/0.42 # Removed by relevancy pruning/SinE : 0
% 0.14/0.42 # Initial clauses : 17
% 0.14/0.42 # Removed in clause preprocessing : 0
% 0.14/0.42 # Initial clauses in saturation : 17
% 0.14/0.42 # Processed clauses : 321
% 0.14/0.42 # ...of these trivial : 4
% 0.14/0.42 # ...subsumed : 124
% 0.14/0.42 # ...remaining for further processing : 193
% 0.14/0.42 # Other redundant clauses eliminated : 0
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 28
% 0.14/0.42 # Backward-rewritten : 15
% 0.14/0.42 # Generated clauses : 913
% 0.14/0.42 # ...of the previous two non-redundant : 744
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 1
% 0.14/0.42 # Paramodulations : 913
% 0.14/0.42 # Factorizations : 0
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 0
% 0.14/0.42 # Disequality decompositions : 0
% 0.14/0.42 # Total rewrite steps : 301
% 0.14/0.42 # ...of those cached : 256
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 133
% 0.14/0.42 # Positive orientable unit clauses : 25
% 0.14/0.42 # Positive unorientable unit clauses: 0
% 0.14/0.42 # Negative unit clauses : 6
% 0.14/0.42 # Non-unit-clauses : 102
% 0.14/0.42 # Current number of unprocessed clauses: 420
% 0.14/0.42 # ...number of literals in the above : 1289
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 60
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 3105
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 2894
% 0.14/0.42 # Non-unit clause-clause subsumptions : 109
% 0.14/0.42 # Unit Clause-clause subsumption calls : 232
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 33
% 0.14/0.42 # BW rewrite match successes : 5
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 9435
% 0.14/0.42 # Search garbage collected termcells : 24
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.021 s
% 0.14/0.42 # System time : 0.001 s
% 0.14/0.42 # Total time : 0.022 s
% 0.14/0.42 # Maximum resident set size: 1660 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.084 s
% 0.14/0.42 # System time : 0.008 s
% 0.14/0.42 # Total time : 0.092 s
% 0.14/0.42 # Maximum resident set size: 1708 pages
% 0.14/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------