TSTP Solution File: GRP128-4.003 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP128-4.003 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:38:47 EDT 2023
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of clauses : 68 ( 23 unt; 31 nHn; 68 RR)
% Number of literals : 164 ( 0 equ; 60 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',product_total_function1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',element_3) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',element_1) ).
cnf(qg3,negated_conjecture,
( product(X1,X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',qg3) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',element_2) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',product_right_cancellation) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',e_1_is_not_e_3) ).
cnf(qg3_1,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X1,X3,X4)
| ~ product(X3,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',qg3_1) ).
cnf(qg3_2,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X1,X3)
| ~ product(X4,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',qg3_2) ).
cnf(row_surjectivity,axiom,
( product(e_1,X1,X2)
| product(e_2,X1,X2)
| product(e_3,X1,X2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',row_surjectivity) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',product_total_function2) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',product_left_cancellation) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',e_3_is_not_e_2) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',e_3_is_not_e_1) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',e_1_is_not_e_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/tmp/tmp.2jfLicPqus/E---3.1_25475.p',e_2_is_not_e_3) ).
cnf(c_0_16,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_17,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_18,plain,
( product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_20,negated_conjecture,
( product(X1,X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X3,X2,X4) ),
qg3 ).
cnf(c_0_21,plain,
( product(e_1,e_3,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_23,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_24,negated_conjecture,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(X1,e_1,e_1)
| ~ product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(X1,e_2,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_26,plain,
( equalish(X1,e_3)
| product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| ~ product(e_1,X1,e_1) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( product(e_1,e_1,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,axiom,
~ equalish(e_1,e_3),
e_1_is_not_e_3 ).
cnf(c_0_29,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X1,X3,X4)
| ~ product(X3,X2,X4) ),
qg3_1 ).
cnf(c_0_30,plain,
( product(e_2,e_2,e_1)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X1,X3)
| ~ product(X4,X2,X1) ),
qg3_2 ).
cnf(c_0_32,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( product(e_2,e_2,e_3)
| product(e_2,e_2,e_2)
| product(X1,e_2,e_2)
| ~ product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_3,e_3,X1)
| ~ product(e_1,e_3,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,axiom,
( product(e_1,X1,X2)
| product(e_2,X1,X2)
| product(e_3,X1,X2)
| ~ group_element(X1)
| ~ group_element(X2) ),
row_surjectivity ).
cnf(c_0_36,negated_conjecture,
( product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_37,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
product_total_function2 ).
cnf(c_0_38,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_39,plain,
( product(e_3,X1,e_3)
| product(e_2,X1,e_3)
| product(e_1,X1,e_3)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_40,negated_conjecture,
( product(e_2,e_2,e_2)
| product(X1,e_2,e_2)
| ~ product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_41,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_42,negated_conjecture,
( equalish(X1,e_2)
| product(e_3,e_3,e_3)
| ~ product(e_1,e_3,X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( product(e_1,e_3,e_3)
| product(e_2,e_3,e_3)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_44,axiom,
~ equalish(e_3,e_2),
e_3_is_not_e_2 ).
cnf(c_0_45,negated_conjecture,
product(e_2,e_2,e_2),
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_46,plain,
( product(e_3,e_3,e_1)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_47,negated_conjecture,
( equalish(X1,e_1)
| product(e_1,e_3,e_2)
| ~ product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_41,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
( product(e_2,e_3,e_3)
| product(e_3,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_49,axiom,
~ equalish(e_3,e_1),
e_3_is_not_e_1 ).
cnf(c_0_50,negated_conjecture,
( equalish(X1,e_2)
| ~ product(e_2,X1,e_2) ),
inference(spm,[status(thm)],[c_0_23,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(X1,e_3,e_3)
| ~ product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_29,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( product(e_2,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_54,negated_conjecture,
~ product(e_2,e_3,e_2),
inference(spm,[status(thm)],[c_0_44,c_0_50]) ).
cnf(c_0_55,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_56,negated_conjecture,
( product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_51,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( product(e_2,e_3,e_3)
| product(X1,e_1,e_2)
| ~ product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_52]) ).
cnf(c_0_58,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_1) ),
inference(sr,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
~ product(e_2,e_1,e_2),
inference(spm,[status(thm)],[c_0_55,c_0_50]) ).
cnf(c_0_60,negated_conjecture,
( equalish(X1,e_3)
| product(e_3,e_3,e_2)
| ~ product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
product(e_2,e_3,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_62,axiom,
~ equalish(e_2,e_3),
e_2_is_not_e_3 ).
cnf(c_0_63,negated_conjecture,
( equalish(X1,e_1)
| product(e_3,e_3,e_3)
| ~ product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
cnf(c_0_64,negated_conjecture,
product(e_3,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( equalish(X1,e_2)
| ~ product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_41,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
product(e_3,e_3,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_49]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP128-4.003 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n026.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 : 2400
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue Oct 3 03:19:44 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.15/0.39 Running first-order theorem proving
% 0.15/0.39 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.2jfLicPqus/E---3.1_25475.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25554 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.41 # Starting new_bool_3 with 136s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 136s (1) cores
% 0.15/0.41 # Starting sh5l with 136s (1) cores
% 0.15/0.41 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25561 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.41 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.41 # No SInE strategy applied
% 0.15/0.41 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.15/0.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.41 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.15/0.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41 # Presaturation interreduction done
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 18
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 18
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 18
% 0.15/0.41 # Processed clauses : 242
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 32
% 0.15/0.41 # ...remaining for further processing : 210
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 35
% 0.15/0.41 # Backward-rewritten : 67
% 0.15/0.41 # Generated clauses : 662
% 0.15/0.41 # ...of the previous two non-redundant : 633
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 0
% 0.15/0.41 # Paramodulations : 641
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 71
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 69
% 0.15/0.41 # Positive orientable unit clauses : 12
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 14
% 0.15/0.41 # Non-unit-clauses : 43
% 0.15/0.41 # Current number of unprocessed clauses: 421
% 0.15/0.41 # ...number of literals in the above : 1541
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 141
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 1452
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 710
% 0.15/0.41 # Non-unit clause-clause subsumptions : 60
% 0.15/0.41 # Unit Clause-clause subsumption calls : 241
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 28
% 0.15/0.41 # BW rewrite match successes : 8
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 9586
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.013 s
% 0.15/0.41 # System time : 0.003 s
% 0.15/0.41 # Total time : 0.016 s
% 0.15/0.41 # Maximum resident set size: 1644 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.071 s
% 0.15/0.41 # System time : 0.007 s
% 0.15/0.41 # Total time : 0.078 s
% 0.15/0.41 # Maximum resident set size: 1684 pages
% 0.15/0.41 % E---3.1 exiting
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------