TSTP Solution File: GRP708-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP708-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:55 EDT 2024
% Result : Unsatisfiable 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 19 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c09,axiom,
mult(mult(op_c,op_c),mult(X1,X2)) = mult(mult(mult(op_c,op_c),X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c08,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,op_c)) != mult(mult(a,b),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c_0_6,axiom,
mult(mult(op_c,op_c),mult(X1,X2)) = mult(mult(mult(op_c,op_c),X1),X2),
c09 ).
cnf(c_0_7,axiom,
mult(op_c,X1) = mult(X1,op_c),
c08 ).
cnf(c_0_8,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_9,plain,
mult(mult(op_c,op_c),mult(op_c,X1)) = mult(op_c,mult(op_c,mult(op_c,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_11,plain,
mult(mult(op_c,op_c),X1) = mult(op_c,mult(op_c,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
mult(a,mult(b,op_c)) != mult(mult(a,b),op_c),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_13,plain,
mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(op_c,mult(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_11]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
mult(a,mult(b,op_c)) != mult(mult(a,b),op_c),
c_0_12 ).
cnf(c_0_15,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_16,plain,
mult(op_c,mult(op_c,mult(X1,X2))) = mult(op_c,mult(X1,mult(op_c,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
mult(a,mult(op_c,b)) != mult(op_c,mult(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7]),c_0_7]) ).
cnf(c_0_18,plain,
mult(op_c,mult(X1,X2)) = mult(X1,mult(op_c,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP708-1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 04:37:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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/benchmark/theBenchmark.p
% 0.18/0.48 # Version: 3.1.0
% 0.18/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3368 completed with status 0
% 0.18/0.48 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.18/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.18/0.48 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.18/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.18/0.48 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.18/0.48 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.18/0.48 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 3372 completed with status 0
% 0.18/0.48 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.18/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.48 # No SInE strategy applied
% 0.18/0.48 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.18/0.48 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.48 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Unsatisfiable
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 10
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 10
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 10
% 0.18/0.48 # Processed clauses : 68
% 0.18/0.48 # ...of these trivial : 7
% 0.18/0.48 # ...subsumed : 14
% 0.18/0.48 # ...remaining for further processing : 47
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 2
% 0.18/0.48 # Backward-rewritten : 8
% 0.18/0.48 # Generated clauses : 467
% 0.18/0.48 # ...of the previous two non-redundant : 281
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 467
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 323
% 0.18/0.49 # ...of those cached : 196
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 27
% 0.18/0.49 # Positive orientable unit clauses : 23
% 0.18/0.49 # Positive unorientable unit clauses: 4
% 0.18/0.49 # Negative unit clauses : 0
% 0.18/0.49 # Non-unit-clauses : 0
% 0.18/0.49 # Current number of unprocessed clauses: 221
% 0.18/0.49 # ...number of literals in the above : 221
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 20
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.49 # Non-unit clause-clause subsumptions : 0
% 0.18/0.49 # Unit Clause-clause subsumption calls : 10
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 46
% 0.18/0.49 # BW rewrite match successes : 28
% 0.18/0.49 # Condensation attempts : 0
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 6396
% 0.18/0.49 # Search garbage collected termcells : 2
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.008 s
% 0.18/0.49 # System time : 0.002 s
% 0.18/0.49 # Total time : 0.010 s
% 0.18/0.49 # Maximum resident set size: 1552 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.037 s
% 0.18/0.49 # System time : 0.008 s
% 0.18/0.49 # Total time : 0.045 s
% 0.18/0.49 # Maximum resident set size: 1688 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------