TSTP Solution File: GRP710+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:01 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 42 ( 31 unt; 0 def)
% Number of atoms : 53 ( 42 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 29 ( 18 ~; 7 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 65 ( 8 sgn; 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f01,axiom,
! [X1] : mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p',f01) ).
fof(f03,axiom,
! [X2,X3,X1] : mult(X1,mult(X3,mult(X3,X2))) = mult(mult(mult(X1,X3),X3),X2),
file('/export/starexec/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p',f03) ).
fof(f05,axiom,
! [X1] : mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p',f05) ).
fof(f02,axiom,
! [X1] : mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p',f02) ).
fof(f04,axiom,
! [X1] : mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p',f04) ).
fof(goals,conjecture,
( ! [X4,X5] :
? [X6] : mult(X4,X6) = X5
& ! [X7,X8] :
? [X9] : mult(X9,X8) = X7 ),
file('/export/starexec/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p',goals) ).
fof(c_0_6,plain,
! [X16] : mult(X16,unit) = X16,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_7,plain,
! [X18,X19,X20] : mult(X20,mult(X19,mult(X19,X18))) = mult(mult(mult(X20,X19),X19),X18),
inference(variable_rename,[status(thm)],[f03]) ).
cnf(c_0_8,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
fof(c_0_11,plain,
! [X22] : mult(i(X22),X22) = unit,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_12,plain,
! [X17] : mult(unit,X17) = X17,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_13,plain,
! [X21] : mult(X21,i(X21)) = unit,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_14,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
mult(i(X1),X1) = unit,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
mult(X1,i(X1)) = unit,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_16]) ).
cnf(c_0_20,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
i(mult(X1,X1)) = mult(i(X1),i(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]),c_0_8]) ).
cnf(c_0_22,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_16]) ).
cnf(c_0_23,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
fof(c_0_24,negated_conjecture,
~ ( ! [X4,X5] :
? [X6] : mult(X4,X6) = X5
& ! [X7,X8] :
? [X9] : mult(X9,X8) = X7 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_25,plain,
( ~ epred2_0
<=> ! [X1] : mult(esk1_0,X1) != esk2_0 ),
introduced(definition) ).
cnf(c_0_26,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_27,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_15]),c_0_8]) ).
fof(c_0_28,negated_conjecture,
! [X12,X15] :
( mult(esk1_0,X12) != esk2_0
| mult(X15,esk4_0) != esk3_0 ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])]) ).
cnf(c_0_29,negated_conjecture,
( epred2_0
| mult(esk1_0,X1) != esk2_0 ),
inference(split_equiv,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
( ~ epred1_0
<=> ! [X2] : mult(X2,esk4_0) != esk3_0 ),
introduced(definition) ).
cnf(c_0_32,negated_conjecture,
( mult(esk1_0,X1) != esk2_0
| mult(X2,esk4_0) != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( epred2_0
| X1 != esk2_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( epred1_0
| mult(X1,esk4_0) != esk3_0 ),
inference(split_equiv,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_32,c_0_31]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
epred2_0,
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( epred1_0
| mult(X1,mult(esk4_0,esk4_0)) != esk3_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_10]) ).
cnf(c_0_38,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
mult(X1,mult(X2,mult(X2,mult(esk4_0,esk4_0)))) != esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
X1 != esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_26]),c_0_15]),c_0_8]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.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 : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:59:31 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.VhH9PoEeR8/E---3.1_3783.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # sh5l with pid 3865 completed with status 0
% 0.17/0.46 # Result found by sh5l
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.17/0.46 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 3873 completed with status 0
% 0.17/0.46 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 6
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 6
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 6
% 0.17/0.46 # Processed clauses : 111
% 0.17/0.46 # ...of these trivial : 3
% 0.17/0.46 # ...subsumed : 47
% 0.17/0.46 # ...remaining for further processing : 61
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 29
% 0.17/0.46 # Backward-rewritten : 11
% 0.17/0.46 # Generated clauses : 661
% 0.17/0.46 # ...of the previous two non-redundant : 556
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 656
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 2
% 0.17/0.46 # Total rewrite steps : 869
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # 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 : 20
% 0.17/0.46 # Positive orientable unit clauses : 17
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 3
% 0.17/0.46 # Non-unit-clauses : 0
% 0.17/0.46 # Current number of unprocessed clauses: 437
% 0.17/0.46 # ...number of literals in the above : 443
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 40
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 105
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 98
% 0.17/0.46 # Non-unit clause-clause subsumptions : 22
% 0.17/0.46 # Unit Clause-clause subsumption calls : 115
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 28
% 0.17/0.46 # BW rewrite match successes : 8
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 8926
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.010 s
% 0.17/0.46 # System time : 0.001 s
% 0.17/0.46 # Total time : 0.012 s
% 0.17/0.46 # Maximum resident set size: 1608 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.012 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.014 s
% 0.17/0.46 # Maximum resident set size: 1672 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------