TSTP Solution File: GRP698-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP698-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 17 ( 16 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; 4 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c07,axiom,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_5,axiom,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
c07 ).
cnf(c_0_6,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_7,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_8,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(X2,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
rd(mult(X1,mult(mult(X2,X1),X1)),X1) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_11,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(mult(X1,rd(X2,X1)),X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_13,plain,
mult(mult(X1,rd(rd(X2,X1),X1)),X1) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
c_0_12 ).
cnf(c_0_15,plain,
mult(rd(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_10]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP698-1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n015.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Sun May 19 05:57:23 EDT 2024
% 0.11/0.35 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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.18/0.50 # Version: 3.1.0
% 0.18/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # sh5l with pid 1414 completed with status 0
% 0.18/0.50 # Result found by sh5l
% 0.18/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.18/0.50 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.18/0.50 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 1416 completed with status 0
% 0.18/0.50 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.18/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50 # Starting sh5l with 300s (1) cores
% 0.18/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.18/0.50 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.18/0.50 # Preprocessing time : 0.001 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Unsatisfiable
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 9
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 9
% 0.18/0.50 # Removed in clause preprocessing : 0
% 0.18/0.50 # Initial clauses in saturation : 9
% 0.18/0.50 # Processed clauses : 84
% 0.18/0.50 # ...of these trivial : 16
% 0.18/0.50 # ...subsumed : 0
% 0.18/0.50 # ...remaining for further processing : 68
% 0.18/0.50 # Other redundant clauses eliminated : 0
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 0
% 0.18/0.50 # Backward-rewritten : 15
% 0.18/0.50 # Generated clauses : 1167
% 0.18/0.50 # ...of the previous two non-redundant : 779
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 0
% 0.18/0.50 # Paramodulations : 1167
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 0
% 0.18/0.50 # Disequality decompositions : 0
% 0.18/0.50 # Total rewrite steps : 1929
% 0.18/0.50 # ...of those cached : 1670
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 44
% 0.18/0.50 # Positive orientable unit clauses : 44
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 0
% 0.18/0.50 # Non-unit-clauses : 0
% 0.18/0.50 # Current number of unprocessed clauses: 697
% 0.18/0.50 # ...number of literals in the above : 697
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 24
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.18/0.50 # Non-unit clause-clause subsumptions : 0
% 0.18/0.50 # Unit Clause-clause subsumption calls : 0
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 65
% 0.18/0.50 # BW rewrite match successes : 11
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 24889
% 0.18/0.50 # Search garbage collected termcells : 2
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.018 s
% 0.18/0.50 # System time : 0.002 s
% 0.18/0.50 # Total time : 0.020 s
% 0.18/0.50 # Maximum resident set size: 1620 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.018 s
% 0.18/0.50 # System time : 0.005 s
% 0.18/0.50 # Total time : 0.023 s
% 0.18/0.50 # Maximum resident set size: 1688 pages
% 0.18/0.50 % E---3.1 exiting
% 0.18/0.50 % E exiting
%------------------------------------------------------------------------------