TSTP Solution File: GRP700-10 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP700-10 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:50:51 EDT 2024
% Result : Unsatisfiable 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 4 RR)
% Number of literals : 22 ( 21 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f08,axiom,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_7,axiom,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
f08 ).
cnf(c_0_8,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_9,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_10,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_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
rd(mult(X1,mult(X1,mult(X2,X1))),X1) = mult(X1,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_14,plain,
mult(X1,mult(X1,rd(X2,X1))) = rd(mult(X1,mult(X1,X2)),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_16,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_17,plain,
ld(X1,rd(mult(X1,mult(X1,X2)),X1)) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
c_0_16 ).
cnf(c_0_20,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_9]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : GRP700-10 : TPTP v8.2.0. Released v8.1.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n014.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 05:29:22 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.16/0.44 # Version: 3.1.0
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 20093 completed with status 0
% 0.16/0.44 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.16/0.44 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.44 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.44 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.44 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.16/0.44 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20102 completed with status 0
% 0.16/0.44 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.16/0.44 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.44 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.16/0.44 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.44 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Unsatisfiable
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 9
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 9
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 9
% 0.16/0.44 # Processed clauses : 63
% 0.16/0.44 # ...of these trivial : 2
% 0.16/0.44 # ...subsumed : 8
% 0.16/0.44 # ...remaining for further processing : 53
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 1
% 0.16/0.44 # Backward-rewritten : 4
% 0.16/0.44 # Generated clauses : 545
% 0.16/0.44 # ...of the previous two non-redundant : 383
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 545
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 716
% 0.16/0.44 # ...of those cached : 584
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 39
% 0.16/0.44 # Positive orientable unit clauses : 32
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 7
% 0.16/0.44 # Non-unit-clauses : 0
% 0.16/0.44 # Current number of unprocessed clauses: 335
% 0.16/0.44 # ...number of literals in the above : 335
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 14
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 6
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 39
% 0.16/0.44 # BW rewrite match successes : 4
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 7960
% 0.16/0.44 # Search garbage collected termcells : 2
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.008 s
% 0.16/0.44 # System time : 0.004 s
% 0.16/0.44 # Total time : 0.012 s
% 0.16/0.44 # Maximum resident set size: 1556 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.045 s
% 0.16/0.44 # System time : 0.012 s
% 0.16/0.44 # Total time : 0.057 s
% 0.16/0.44 # Maximum resident set size: 1684 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------