TSTP Solution File: GRP657+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP657+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Sat May 4 07:53:46 EDT 2024
% Result : Theorem 0.35s 0.54s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 0 con; 1-2 aty)
% Number of variables : 49 ( 0 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.WYRscP1Xx9/E---3.1_23406.p',f02) ).
fof(f05,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(X3,X2)) = mult(X2,mult(mult(X1,X3),X2)),
file('/export/starexec/sandbox2/tmp/tmp.WYRscP1Xx9/E---3.1_23406.p',f05) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.WYRscP1Xx9/E---3.1_23406.p',f01) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/tmp/tmp.WYRscP1Xx9/E---3.1_23406.p',f04) ).
fof(goals,conjecture,
? [X4] :
! [X5] :
( mult(X5,X4) = X5
& mult(X4,X5) = X5 ),
file('/export/starexec/sandbox2/tmp/tmp.WYRscP1Xx9/E---3.1_23406.p',goals) ).
fof(c_0_5,plain,
! [X11,X12] : ld(X12,mult(X12,X11)) = X11,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_6,plain,
! [X17,X18,X19] : mult(mult(X19,X18),mult(X17,X19)) = mult(X19,mult(mult(X18,X17),X19)),
inference(variable_rename,[status(thm)],[f05]) ).
cnf(c_0_7,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X9,X10] : mult(X10,ld(X10,X9)) = X9,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_10,plain,
ld(X1,mult(mult(X1,X2),mult(X3,X1))) = mult(mult(X2,X3),X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X15,X16] : rd(mult(X16,X15),X15) = X16,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_13,plain,
ld(X1,mult(X2,mult(X3,X1))) = mult(mult(ld(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
mult(mult(ld(X1,X1),X2),X1) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ? [X4] :
! [X5] :
( mult(X5,X4) = X5
& mult(X4,X5) = X5 ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_17,plain,
mult(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
fof(c_0_18,negated_conjecture,
! [X6] :
( mult(esk1_1(X6),X6) != esk1_1(X6)
| mult(X6,esk2_1(X6)) != esk2_1(X6) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])]) ).
cnf(c_0_19,plain,
rd(X1,X1) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( mult(esk1_1(X1),X1) != esk1_1(X1)
| mult(X1,esk2_1(X1)) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
mult(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_22,plain,
mult(X1,rd(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP657+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n023.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 16:03:08 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.WYRscP1Xx9/E---3.1_23406.p
% 0.35/0.54 # Version: 3.1.0
% 0.35/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.54 # Starting sh5l with 300s (1) cores
% 0.35/0.54 # sh5l with pid 23488 completed with status 0
% 0.35/0.54 # Result found by sh5l
% 0.35/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.54 # Starting sh5l with 300s (1) cores
% 0.35/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.35/0.54 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.35/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.54 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.35/0.54 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 23496 completed with status 0
% 0.35/0.54 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.35/0.54 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.35/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.54 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.35/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.54 # Starting sh5l with 300s (1) cores
% 0.35/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.35/0.54 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.35/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.54 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 163s (1) cores
% 0.35/0.54 # Preprocessing time : 0.001 s
% 0.35/0.54
% 0.35/0.54 # Proof found!
% 0.35/0.54 # SZS status Theorem
% 0.35/0.54 # SZS output start CNFRefutation
% See solution above
% 0.35/0.54 # Parsed axioms : 6
% 0.35/0.54 # Removed by relevancy pruning/SinE : 0
% 0.35/0.54 # Initial clauses : 6
% 0.35/0.54 # Removed in clause preprocessing : 0
% 0.35/0.54 # Initial clauses in saturation : 6
% 0.35/0.54 # Processed clauses : 18
% 0.35/0.54 # ...of these trivial : 1
% 0.35/0.54 # ...subsumed : 0
% 0.35/0.54 # ...remaining for further processing : 17
% 0.35/0.54 # Other redundant clauses eliminated : 0
% 0.35/0.54 # Clauses deleted for lack of memory : 0
% 0.35/0.54 # Backward-subsumed : 0
% 0.35/0.54 # Backward-rewritten : 2
% 0.35/0.54 # Generated clauses : 107
% 0.35/0.54 # ...of the previous two non-redundant : 77
% 0.35/0.54 # ...aggressively subsumed : 0
% 0.35/0.54 # Contextual simplify-reflections : 0
% 0.35/0.54 # Paramodulations : 107
% 0.35/0.54 # Factorizations : 0
% 0.35/0.54 # NegExts : 0
% 0.35/0.54 # Equation resolutions : 0
% 0.35/0.54 # Disequality decompositions : 0
% 0.35/0.54 # Total rewrite steps : 34
% 0.35/0.54 # ...of those cached : 13
% 0.35/0.54 # Propositional unsat checks : 0
% 0.35/0.54 # Propositional check models : 0
% 0.35/0.54 # Propositional check unsatisfiable : 0
% 0.35/0.54 # Propositional clauses : 0
% 0.35/0.54 # Propositional clauses after purity: 0
% 0.35/0.54 # Propositional unsat core size : 0
% 0.35/0.54 # Propositional preprocessing time : 0.000
% 0.35/0.54 # Propositional encoding time : 0.000
% 0.35/0.54 # Propositional solver time : 0.000
% 0.35/0.54 # Success case prop preproc time : 0.000
% 0.35/0.54 # Success case prop encoding time : 0.000
% 0.35/0.54 # Success case prop solver time : 0.000
% 0.35/0.54 # Current number of processed clauses : 15
% 0.35/0.54 # Positive orientable unit clauses : 12
% 0.35/0.54 # Positive unorientable unit clauses: 2
% 0.35/0.54 # Negative unit clauses : 0
% 0.35/0.54 # Non-unit-clauses : 1
% 0.35/0.54 # Current number of unprocessed clauses: 65
% 0.35/0.54 # ...number of literals in the above : 65
% 0.35/0.54 # Current number of archived formulas : 0
% 0.35/0.54 # Current number of archived clauses : 2
% 0.35/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.35/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.35/0.54 # Non-unit clause-clause subsumptions : 0
% 0.35/0.54 # Unit Clause-clause subsumption calls : 2
% 0.35/0.54 # Rewrite failures with RHS unbound : 5
% 0.35/0.54 # BW rewrite match attempts : 15
% 0.35/0.54 # BW rewrite match successes : 3
% 0.35/0.54 # Condensation attempts : 0
% 0.35/0.54 # Condensation successes : 0
% 0.35/0.54 # Termbank termtop insertions : 973
% 0.35/0.54 # Search garbage collected termcells : 30
% 0.35/0.54
% 0.35/0.54 # -------------------------------------------------
% 0.35/0.54 # User time : 0.005 s
% 0.35/0.54 # System time : 0.002 s
% 0.35/0.54 # Total time : 0.006 s
% 0.35/0.54 # Maximum resident set size: 1600 pages
% 0.35/0.54
% 0.35/0.54 # -------------------------------------------------
% 0.35/0.54 # User time : 0.005 s
% 0.35/0.54 # System time : 0.005 s
% 0.35/0.54 # Total time : 0.010 s
% 0.35/0.54 # Maximum resident set size: 1688 pages
% 0.35/0.54 % E---3.1 exiting
% 0.35/0.54 % E exiting
%------------------------------------------------------------------------------