TSTP Solution File: GRP025-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP025-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:43:40 EDT 2024
% Result : Unsatisfiable 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 17
% Syntax : Number of clauses : 76 ( 37 unt; 19 nHn; 76 RR)
% Number of literals : 136 ( 76 equ; 44 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a_and_b_only_members_of_group1,hypothesis,
( X1 = a
| X1 = b
| ~ group_member(X1,g1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_and_b_only_members_of_group1) ).
cnf(d3_member_of_group1,hypothesis,
group_member(d3,g1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_member_of_group1) ).
cnf(prove_product_holds_in_group2,negated_conjecture,
~ product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_product_holds_in_group2) ).
cnf(d2_member_of_group1,hypothesis,
group_member(d2,g1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_member_of_group1) ).
cnf(b_maps_to_d,hypothesis,
an_isomorphism(b) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_maps_to_d) ).
cnf(d1_member_of_group1,hypothesis,
group_member(d1,g1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_member_of_group1) ).
cnf(a_maps_to_c,hypothesis,
an_isomorphism(a) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_maps_to_c) ).
cnf(c_times_d_is_d,hypothesis,
product(g2,c,d,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_times_d_is_d) ).
cnf(total_function2,axiom,
( X5 = X4
| ~ product(X1,X2,X3,X4)
| ~ product(X1,X2,X3,X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP006-0.ax',total_function2) ).
cnf(d1_times_d2_is_d3,hypothesis,
product(g1,d1,d2,d3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_times_d2_is_d3) ).
cnf(c_times_c_is_c,hypothesis,
product(g2,c,c,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_times_c_is_c) ).
cnf(b_times_b_is_a,hypothesis,
product(g1,b,b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_b_is_a) ).
cnf(d_times_d_is_c,hypothesis,
product(g2,d,d,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_times_d_is_c) ).
cnf(a_times_a_is_a,hypothesis,
product(g1,a,a,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_a_is_a) ).
cnf(a_times_b_is_b,hypothesis,
product(g1,a,b,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b_is_b) ).
cnf(b_times_a_is_b,hypothesis,
product(g1,b,a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_is_b) ).
cnf(d_times_c_is_d,hypothesis,
product(g2,d,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_times_c_is_d) ).
cnf(c_0_17,hypothesis,
( X1 = a
| X1 = b
| ~ group_member(X1,g1) ),
inference(fof_simplification,[status(thm)],[a_and_b_only_members_of_group1]) ).
cnf(c_0_18,hypothesis,
( X1 = a
| X1 = b
| ~ group_member(X1,g1) ),
c_0_17 ).
cnf(c_0_19,hypothesis,
group_member(d3,g1),
d3_member_of_group1 ).
cnf(c_0_20,negated_conjecture,
~ product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)),
inference(fof_simplification,[status(thm)],[prove_product_holds_in_group2]) ).
cnf(c_0_21,hypothesis,
( d3 = b
| d3 = a ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
group_member(d2,g1),
d2_member_of_group1 ).
cnf(c_0_23,negated_conjecture,
~ product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)),
c_0_20 ).
cnf(c_0_24,hypothesis,
( d3 = b
| a != b ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
an_isomorphism(b) = d,
b_maps_to_d ).
cnf(c_0_26,hypothesis,
( d2 = b
| d2 = a ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( a != b
| ~ product(g2,an_isomorphism(d1),an_isomorphism(d2),d) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,hypothesis,
( d2 = b
| a != b ),
inference(ef,[status(thm)],[c_0_26]) ).
cnf(c_0_29,hypothesis,
group_member(d1,g1),
d1_member_of_group1 ).
cnf(c_0_30,hypothesis,
( a != b
| ~ product(g2,an_isomorphism(d1),d,d) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25]) ).
cnf(c_0_31,hypothesis,
( d1 = b
| d1 = a ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_32,hypothesis,
an_isomorphism(a) = c,
a_maps_to_c ).
cnf(c_0_33,hypothesis,
product(g2,c,d,d),
c_times_d_is_d ).
cnf(c_0_34,plain,
( X5 = X4
| ~ product(X1,X2,X3,X4)
| ~ product(X1,X2,X3,X5) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_35,hypothesis,
product(g1,d1,d2,d3),
d1_times_d2_is_d3 ).
cnf(c_0_36,hypothesis,
( d1 = b
| a != b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_37,negated_conjecture,
( d3 = b
| ~ product(g2,an_isomorphism(d1),an_isomorphism(d2),c) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_32]) ).
cnf(c_0_38,plain,
( X5 = X4
| ~ product(X1,X2,X3,X4)
| ~ product(X1,X2,X3,X5) ),
c_0_34 ).
cnf(c_0_39,hypothesis,
( product(g1,b,d2,d3)
| a != b ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,hypothesis,
( d2 = b
| d3 = b
| ~ product(g2,an_isomorphism(d1),c,c) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_26]),c_0_32]) ).
cnf(c_0_41,hypothesis,
product(g2,c,c,c),
c_times_c_is_c ).
cnf(c_0_42,hypothesis,
( X1 = d3
| a != b
| ~ product(g1,b,d2,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,hypothesis,
( d1 = b
| d3 = b
| d2 = b ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_31]),c_0_32]),c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
( a != b
| ~ product(g2,an_isomorphism(d1),d,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_25]) ).
cnf(c_0_45,hypothesis,
( X1 = d3
| a != b
| ~ product(g1,b,b,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_28]) ).
cnf(c_0_46,hypothesis,
product(g1,b,b,a),
b_times_b_is_a ).
cnf(c_0_47,hypothesis,
( d2 = b
| d1 = b
| product(g1,d1,d2,b) ),
inference(spm,[status(thm)],[c_0_35,c_0_43]) ).
cnf(c_0_48,hypothesis,
( a != b
| ~ product(g2,d,d,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_25]) ).
cnf(c_0_49,hypothesis,
( d3 = a
| a != b ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,hypothesis,
product(g2,d,d,c),
d_times_d_is_c ).
cnf(c_0_51,hypothesis,
( d1 = b
| d2 = b
| X1 = b
| ~ product(g1,d1,d2,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
cnf(c_0_52,hypothesis,
a != b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32]),c_0_50])]) ).
cnf(c_0_53,hypothesis,
( d2 = b
| d1 = b
| X1 = b
| ~ product(g1,d1,a,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_26]),c_0_52]) ).
cnf(c_0_54,hypothesis,
( d1 = b
| d2 = b
| X1 = b
| ~ product(g1,a,a,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_31]),c_0_52]) ).
cnf(c_0_55,hypothesis,
product(g1,a,a,a),
a_times_a_is_a ).
cnf(c_0_56,hypothesis,
( X1 = d3
| ~ product(g1,d1,d2,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_57,hypothesis,
( d2 = b
| d1 = b ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_52]) ).
cnf(c_0_58,hypothesis,
( d1 = b
| X1 = d3
| ~ product(g1,d1,b,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( d1 = b
| ~ product(g2,c,an_isomorphism(d2),an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_32]) ).
cnf(c_0_60,hypothesis,
( d1 = b
| X1 = d3
| ~ product(g1,a,b,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_52]) ).
cnf(c_0_61,hypothesis,
product(g1,a,b,b),
a_times_b_is_b ).
cnf(c_0_62,negated_conjecture,
( d1 = b
| ~ product(g2,c,d,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_57]),c_0_25]) ).
cnf(c_0_63,hypothesis,
( d3 = b
| d1 = b ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,hypothesis,
( d2 = b
| X1 = d3
| ~ product(g1,d1,a,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_26]) ).
cnf(c_0_65,negated_conjecture,
d1 = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_25]),c_0_33])]) ).
cnf(c_0_66,hypothesis,
( d2 = b
| X1 = d3
| ~ product(g1,b,a,X1) ),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_67,hypothesis,
product(g1,b,a,b),
b_times_a_is_b ).
cnf(c_0_68,negated_conjecture,
( d2 = b
| ~ product(g2,an_isomorphism(d1),c,an_isomorphism(d3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_26]),c_0_32]) ).
cnf(c_0_69,hypothesis,
( d3 = b
| d2 = b ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,hypothesis,
product(g2,d,c,d),
d_times_c_is_d ).
cnf(c_0_71,negated_conjecture,
d2 = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_65]),c_0_25]),c_0_25]),c_0_70])]) ).
cnf(c_0_72,negated_conjecture,
d3 = b,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_71]),c_0_65]),c_0_25]),c_0_25]),c_0_50])]) ).
cnf(c_0_73,hypothesis,
( X1 = a
| ~ product(g1,b,b,X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_46]) ).
cnf(c_0_74,hypothesis,
product(g1,b,b,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_65]),c_0_71]),c_0_72]) ).
cnf(c_0_75,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP025-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 04:11:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.17/0.45 # Version: 3.1.0
% 0.17/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 29646 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGUSF-FFSM11-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 29650 completed with status 0
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGUSF-FFSM11-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Unsatisfiable
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 32
% 0.17/0.45 # Removed by relevancy pruning/SinE : 8
% 0.17/0.45 # Initial clauses : 24
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 24
% 0.17/0.45 # Processed clauses : 144
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 31
% 0.17/0.45 # ...remaining for further processing : 113
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 28
% 0.17/0.45 # Backward-rewritten : 28
% 0.17/0.45 # Generated clauses : 236
% 0.17/0.45 # ...of the previous two non-redundant : 227
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 233
% 0.17/0.45 # Factorizations : 3
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 173
% 0.17/0.45 # ...of those cached : 160
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 33
% 0.17/0.46 # Positive orientable unit clauses : 18
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 4
% 0.17/0.46 # Non-unit-clauses : 11
% 0.17/0.46 # Current number of unprocessed clauses: 94
% 0.17/0.46 # ...number of literals in the above : 294
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 80
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 311
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 261
% 0.17/0.46 # Non-unit clause-clause subsumptions : 43
% 0.17/0.46 # Unit Clause-clause subsumption calls : 40
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 15
% 0.17/0.46 # BW rewrite match successes : 3
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 3048
% 0.17/0.46 # Search garbage collected termcells : 53
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.006 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.009 s
% 0.17/0.46 # Maximum resident set size: 1604 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.007 s
% 0.17/0.46 # System time : 0.006 s
% 0.17/0.46 # Total time : 0.012 s
% 0.17/0.46 # Maximum resident set size: 1724 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------