TSTP Solution File: GRP700+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP700+1 : TPTP v8.2.0. 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 : Mon May 20 20:58:52 EDT 2024
% Result : Theorem 0.20s 0.45s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 25 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 25 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f08,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),mult(X1,mult(X3,X1))) = mult(mult(X2,mult(X1,mult(X1,X3))),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
fof(goals,conjecture,
! [X4] :
? [X5] :
( mult(X5,X4) = unit
& mult(X4,X5) = unit ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f05,axiom,
! [X2] : mult(X2,unit) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
fof(c_0_7,plain,
! [X21,X22,X23] : mult(mult(X23,X22),mult(X22,mult(X21,X22))) = mult(mult(X23,mult(X22,mult(X22,X21))),X22),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_8,plain,
! [X9] : mult(unit,X9) = X9,
inference(variable_rename,[status(thm)],[f06]) ).
fof(c_0_9,plain,
! [X16,X17] : rd(mult(X17,X16),X16) = X17,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_10,plain,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
fof(c_0_14,plain,
! [X14,X15] : mult(rd(X15,X14),X14) = X15,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_15,negated_conjecture,
~ ! [X4] :
? [X5] :
( mult(X5,X4) = unit
& mult(X4,X5) = unit ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_16,plain,
rd(mult(X1,mult(X1,mult(X2,X1))),X1) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X8] : mult(X8,unit) = X8,
inference(variable_rename,[status(thm)],[f05]) ).
fof(c_0_19,plain,
! [X12,X13] : ld(X13,mult(X13,X12)) = X12,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_20,negated_conjecture,
! [X7] :
( mult(X7,esk1_0) != unit
| mult(esk1_0,X7) != unit ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_21,plain,
rd(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,rd(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
mult(X1,unit) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( mult(X1,esk1_0) != unit
| mult(esk1_0,X1) != unit ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
mult(X1,mult(X1,rd(unit,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]) ).
cnf(c_0_26,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( mult(esk1_0,rd(X1,esk1_0)) != unit
| X1 != unit ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_28,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP700+1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 05:35:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.43 Running first-order model finding
% 0.20/0.43 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.20/0.45 # Version: 3.1.0
% 0.20/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.45 # Starting sh5l with 300s (1) cores
% 0.20/0.45 # sh5l with pid 25598 completed with status 0
% 0.20/0.45 # Result found by sh5l
% 0.20/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.45 # Starting sh5l with 300s (1) cores
% 0.20/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.45 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.20/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.45 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.45 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 25606 completed with status 0
% 0.20/0.45 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.20/0.45 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.45 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.45 # Starting sh5l with 300s (1) cores
% 0.20/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.45 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.20/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.45 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.20/0.45 # Preprocessing time : 0.001 s
% 0.20/0.45 # Presaturation interreduction done
% 0.20/0.45
% 0.20/0.45 # Proof found!
% 0.20/0.45 # SZS status Theorem
% 0.20/0.45 # SZS output start CNFRefutation
% See solution above
% 0.20/0.45 # Parsed axioms : 9
% 0.20/0.45 # Removed by relevancy pruning/SinE : 0
% 0.20/0.45 # Initial clauses : 9
% 0.20/0.45 # Removed in clause preprocessing : 0
% 0.20/0.45 # Initial clauses in saturation : 9
% 0.20/0.45 # Processed clauses : 91
% 0.20/0.45 # ...of these trivial : 6
% 0.20/0.45 # ...subsumed : 24
% 0.20/0.45 # ...remaining for further processing : 61
% 0.20/0.45 # Other redundant clauses eliminated : 0
% 0.20/0.45 # Clauses deleted for lack of memory : 0
% 0.20/0.45 # Backward-subsumed : 0
% 0.20/0.45 # Backward-rewritten : 5
% 0.20/0.45 # Generated clauses : 569
% 0.20/0.45 # ...of the previous two non-redundant : 410
% 0.20/0.45 # ...aggressively subsumed : 0
% 0.20/0.45 # Contextual simplify-reflections : 0
% 0.20/0.45 # Paramodulations : 569
% 0.20/0.45 # Factorizations : 0
% 0.20/0.45 # NegExts : 0
% 0.20/0.45 # Equation resolutions : 0
% 0.20/0.45 # Disequality decompositions : 0
% 0.20/0.45 # Total rewrite steps : 692
% 0.20/0.45 # ...of those cached : 572
% 0.20/0.45 # Propositional unsat checks : 0
% 0.20/0.45 # Propositional check models : 0
% 0.20/0.45 # Propositional check unsatisfiable : 0
% 0.20/0.45 # Propositional clauses : 0
% 0.20/0.45 # Propositional clauses after purity: 0
% 0.20/0.45 # Propositional unsat core size : 0
% 0.20/0.45 # Propositional preprocessing time : 0.000
% 0.20/0.45 # Propositional encoding time : 0.000
% 0.20/0.45 # Propositional solver time : 0.000
% 0.20/0.45 # Success case prop preproc time : 0.000
% 0.20/0.45 # Success case prop encoding time : 0.000
% 0.20/0.45 # Success case prop solver time : 0.000
% 0.20/0.45 # Current number of processed clauses : 47
% 0.20/0.45 # Positive orientable unit clauses : 32
% 0.20/0.45 # Positive unorientable unit clauses: 0
% 0.20/0.45 # Negative unit clauses : 5
% 0.20/0.45 # Non-unit-clauses : 10
% 0.20/0.45 # Current number of unprocessed clauses: 334
% 0.20/0.45 # ...number of literals in the above : 384
% 0.20/0.45 # Current number of archived formulas : 0
% 0.20/0.45 # Current number of archived clauses : 14
% 0.20/0.45 # Clause-clause subsumption calls (NU) : 79
% 0.20/0.45 # Rec. Clause-clause subsumption calls : 79
% 0.20/0.45 # Non-unit clause-clause subsumptions : 8
% 0.20/0.45 # Unit Clause-clause subsumption calls : 22
% 0.20/0.45 # Rewrite failures with RHS unbound : 0
% 0.20/0.45 # BW rewrite match attempts : 35
% 0.20/0.45 # BW rewrite match successes : 5
% 0.20/0.45 # Condensation attempts : 0
% 0.20/0.45 # Condensation successes : 0
% 0.20/0.45 # Termbank termtop insertions : 8775
% 0.20/0.45 # Search garbage collected termcells : 25
% 0.20/0.45
% 0.20/0.45 # -------------------------------------------------
% 0.20/0.45 # User time : 0.010 s
% 0.20/0.45 # System time : 0.001 s
% 0.20/0.45 # Total time : 0.011 s
% 0.20/0.45 # Maximum resident set size: 1596 pages
% 0.20/0.45
% 0.20/0.45 # -------------------------------------------------
% 0.20/0.45 # User time : 0.011 s
% 0.20/0.45 # System time : 0.003 s
% 0.20/0.45 # Total time : 0.013 s
% 0.20/0.45 # Maximum resident set size: 1688 pages
% 0.20/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------