TMTP Model File: RNG042-1.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : RNG042-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n123.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32286.75MB
% OS : Linux 2.6.32-504.23.4.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 9 22:24:21 EDT 2015
% Result : Satisfiable 13.19s
% Output : Saturation 13.19s
% Verified :
% Statistics : Number of clauses : 25 ( 25 expanded)
% Number of leaves : 25 ( 25 expanded)
% Depth : 0
% Number of atoms : 74 ( 74 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 5 ( 3 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---4.0 format not known, defaulting to TPTP
cnf(u43,axiom,
( sQ0_eqProxy(X0,X0) )).
cnf(additive_identity1,axiom,
( sum(additive_identity,X0,X0) )).
cnf(additive_identity2,axiom,
( sum(X0,additive_identity,X0) )).
cnf(left_inverse,axiom,
( sum(additive_inverse(X0),X0,additive_identity) )).
cnf(right_inverse,axiom,
( sum(X0,additive_inverse(X0),additive_identity) )).
cnf(closure_of_multiplication,axiom,
( product(X0,X1,multiply(X0,X1)) )).
cnf(closure_of_addition,axiom,
( sum(X0,X1,add(X0,X1)) )).
cnf(u44,axiom,
( sQ0_eqProxy(X1,X0)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(commutativity_of_addition,axiom,
( sum(X1,X0,X3)
| ~ sum(X0,X1,X3) )).
cnf(u40,axiom,
( sQ0_eqProxy(additive_inverse(X0),additive_inverse(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u45,axiom,
( sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u36,axiom,
( sQ0_eqProxy(X2,X4)
| ~ product(X0,X1,X4)
| ~ product(X0,X1,X2) )).
cnf(u37,axiom,
( sQ0_eqProxy(X2,X4)
| ~ sum(X0,X1,X4)
| ~ sum(X0,X1,X2) )).
cnf(u38,axiom,
( sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u39,axiom,
( sQ0_eqProxy(add(X0,X2),add(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(associativity_of_addition1,axiom,
( sum(X0,X4,X5)
| ~ sum(X2,X3,X5)
| ~ sum(X1,X3,X4)
| ~ sum(X0,X1,X2) )).
cnf(associativity_of_addition2,axiom,
( sum(X2,X3,X5)
| ~ sum(X0,X4,X5)
| ~ sum(X1,X3,X4)
| ~ sum(X0,X1,X2) )).
cnf(associativity_of_multiplication1,axiom,
( product(X0,X4,X5)
| ~ product(X2,X3,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) )).
cnf(associativity_of_multiplication2,axiom,
( product(X2,X3,X5)
| ~ product(X0,X4,X5)
| ~ product(X1,X3,X4)
| ~ product(X0,X1,X2) )).
cnf(u41,axiom,
( sum(X1,X3,X5)
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X4,X5)
| ~ sum(X0,X2,X4)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u42,axiom,
( product(X1,X3,X5)
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X4,X5)
| ~ product(X0,X2,X4)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(distributivity1,axiom,
( sum(X6,X7,X9)
| ~ product(X0,X8,X9)
| ~ product(X0,X3,X7)
| ~ sum(X1,X3,X8)
| ~ product(X0,X1,X6) )).
cnf(distributivity2,axiom,
( product(X0,X8,X9)
| ~ product(X0,X3,X7)
| ~ sum(X6,X7,X9)
| ~ sum(X1,X3,X8)
| ~ product(X0,X1,X6) )).
cnf(distributivity3,axiom,
( sum(X6,X7,X9)
| ~ product(X8,X0,X9)
| ~ product(X3,X0,X7)
| ~ sum(X1,X3,X8)
| ~ product(X1,X0,X6) )).
cnf(distributivity4,axiom,
( product(X8,X0,X9)
| ~ product(X3,X0,X7)
| ~ sum(X6,X7,X9)
| ~ sum(X1,X3,X8)
| ~ product(X1,X0,X6) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : RNG042-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.05 % Command : vampire --mode casc -t %d %s
% 0.02/1.08 % Computer : n123.star.cs.uiowa.edu
% 0.02/1.08 % Model : x86_64 x86_64
% 0.02/1.08 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.08 % Memory : 32286.75MB
% 0.02/1.08 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.02/1.08 % CPULimit : 300
% 0.02/1.08 % DateTime : Tue Jul 7 11:35:27 CDT 2015
% 0.02/1.08 % CPUTime :
% 0.02/1.09 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.02/1.09 % remaining time: 3000 next slice time: 130
% 0.02/1.10 lrs+11_2:3_cond=on:gs=on:gsem=on:lwlo=on:nwc=1.7:sas=minisat:stl=30:spl=off:updr=off_123 on theBenchmark
% 13.08/14.19 % (17794)Time limit reached!
% 13.08/14.19 % ------------------------------
% 13.08/14.19 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.08/14.19 % Termination reason: Time limit
% 13.08/14.19 % Termination phase: Saturation
% 13.08/14.19
% 13.08/14.19 % Active clauses: 1470
% 13.08/14.19 % Passive clauses: 11445
% 13.08/14.19 % Generated clauses: 431870
% 13.08/14.19 % Final active clauses: 1375
% 13.08/14.19 % Final passive clauses: 2606
% 13.08/14.19 % Input clauses: 17
% 13.08/14.19 % Initial clauses: 17
% 13.08/14.19 % Discarded non-redundant clauses: 299436
% 13.08/14.19 %
% 13.08/14.19 % Fw subsumption resolutions: 196
% 13.08/14.19 % Fw demodulations: 250464
% 13.08/14.19 % Bw demodulations: 606
% 13.08/14.19 % Condensations: 4
% 13.08/14.19 %
% 13.08/14.19 % Simple tautologies: 629
% 13.08/14.19 % Equational tautologies: 164
% 13.08/14.19 % Forward subsumptions: 166400
% 13.08/14.19 % Fw demodulations to eq. taut.: 2158
% 13.08/14.19 %
% 13.08/14.19 % Binary resolution: 63183
% 13.08/14.19 % Forward superposition: 75522
% 13.08/14.19 % Backward superposition: 41772
% 13.08/14.19 % Self superposition: 106
% 13.08/14.19 %
% 13.08/14.19 % SAT solver clauses: 11446
% 13.08/14.19 % SAT solver unit clauses: 4475
% 13.08/14.19 % SAT solver binary clauses: 6096
% 13.08/14.19 %
% 13.08/14.19 % Memory used [KB]: 299611
% 13.08/14.19 % Time elapsed: 13.100 s
% 13.08/14.19 % ------------------------------
% 13.08/14.19 ---- Runtime statistics ----
% 13.08/14.19 binary resolutions skipped for weight limit before building clause: 224
% 13.08/14.19 binary resolutions skipped for weight limit while building clause: 42519
% 13.08/14.19 clauses created: 502372
% 13.08/14.19 clauses deleted: 485737
% 13.08/14.19 clauses discarded by weight limit in forward simplification: 86
% 13.08/14.19 clauses discarded from active on weight limit update: 71
% 13.08/14.19 clauses discarded from passive on weight limit update: 6787
% 13.08/14.19 superpositions skipped for weight limit while constructing other literals: 27983
% 13.08/14.19 superpositions weight skipped after rewrited literal weight retrieval: 221459
% 13.08/14.19 superpositions weight skipped after rewriter weight retrieval: 32
% 13.08/14.19 superpositions weight skipped early: 275
% 13.08/14.19 -----------------------------
% 13.08/14.19 % ------------------------------
% 13.19/14.21 % remaining time: 2868 next slice time: 4
% 13.19/14.21 ins+11_3:1_cond=fast:fde=unused:gs=on:igbrr=0.6:igrr=16/1:igrp=400:igrpq=1.1:igs=1002:igwr=on:nwc=1:spl=off_2 on theBenchmark
% 13.19/14.21 % SZS status Satisfiable for theBenchmark
% 13.19/14.21 Satisfiable!
% 13.19/14.21 % # SZS output start Saturation.
% 13.19/14.21 cnf(u43,axiom,
% 13.19/14.21 sQ0_eqProxy(X0,X0)).
% 13.19/14.21
% 13.19/14.21 cnf(additive_identity1,axiom,
% 13.19/14.21 sum(additive_identity,X0,X0)).
% 13.19/14.21
% 13.19/14.21 cnf(additive_identity2,axiom,
% 13.19/14.21 sum(X0,additive_identity,X0)).
% 13.19/14.21
% 13.19/14.21 cnf(left_inverse,axiom,
% 13.19/14.21 sum(additive_inverse(X0),X0,additive_identity)).
% 13.19/14.21
% 13.19/14.21 cnf(right_inverse,axiom,
% 13.19/14.21 sum(X0,additive_inverse(X0),additive_identity)).
% 13.19/14.21
% 13.19/14.21 cnf(closure_of_multiplication,axiom,
% 13.19/14.21 product(X0,X1,multiply(X0,X1))).
% 13.19/14.21
% 13.19/14.21 cnf(closure_of_addition,axiom,
% 13.19/14.21 sum(X0,X1,add(X0,X1))).
% 13.19/14.21
% 13.19/14.21 cnf(u44,axiom,
% 13.19/14.21 sQ0_eqProxy(X1,X0) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(commutativity_of_addition,axiom,
% 13.19/14.21 sum(X1,X0,X3) | ~sum(X0,X1,X3)).
% 13.19/14.21
% 13.19/14.21 cnf(u40,axiom,
% 13.19/14.21 sQ0_eqProxy(additive_inverse(X0),additive_inverse(X1)) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(u45,axiom,
% 13.19/14.21 sQ0_eqProxy(X0,X2) | ~sQ0_eqProxy(X1,X2) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(u36,axiom,
% 13.19/14.21 sQ0_eqProxy(X2,X4) | ~product(X0,X1,X4) | ~product(X0,X1,X2)).
% 13.19/14.21
% 13.19/14.21 cnf(u37,axiom,
% 13.19/14.21 sQ0_eqProxy(X2,X4) | ~sum(X0,X1,X4) | ~sum(X0,X1,X2)).
% 13.19/14.21
% 13.19/14.21 cnf(u38,axiom,
% 13.19/14.21 sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(u39,axiom,
% 13.19/14.21 sQ0_eqProxy(add(X0,X2),add(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(associativity_of_addition1,axiom,
% 13.19/14.21 sum(X0,X4,X5) | ~sum(X2,X3,X5) | ~sum(X1,X3,X4) | ~sum(X0,X1,X2)).
% 13.19/14.21
% 13.19/14.21 cnf(associativity_of_addition2,axiom,
% 13.19/14.21 sum(X2,X3,X5) | ~sum(X0,X4,X5) | ~sum(X1,X3,X4) | ~sum(X0,X1,X2)).
% 13.19/14.21
% 13.19/14.21 cnf(associativity_of_multiplication1,axiom,
% 13.19/14.21 product(X0,X4,X5) | ~product(X2,X3,X5) | ~product(X1,X3,X4) | ~product(X0,X1,X2)).
% 13.19/14.21
% 13.19/14.21 cnf(associativity_of_multiplication2,axiom,
% 13.19/14.21 product(X2,X3,X5) | ~product(X0,X4,X5) | ~product(X1,X3,X4) | ~product(X0,X1,X2)).
% 13.19/14.21
% 13.19/14.21 cnf(u41,axiom,
% 13.19/14.21 sum(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~sum(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(u42,axiom,
% 13.19/14.21 product(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~product(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.19/14.21
% 13.19/14.21 cnf(distributivity1,axiom,
% 13.19/14.21 sum(X6,X7,X9) | ~product(X0,X8,X9) | ~product(X0,X3,X7) | ~sum(X1,X3,X8) | ~product(X0,X1,X6)).
% 13.19/14.21
% 13.19/14.21 cnf(distributivity2,axiom,
% 13.19/14.21 product(X0,X8,X9) | ~product(X0,X3,X7) | ~sum(X6,X7,X9) | ~sum(X1,X3,X8) | ~product(X0,X1,X6)).
% 13.19/14.21
% 13.19/14.21 cnf(distributivity3,axiom,
% 13.19/14.21 sum(X6,X7,X9) | ~product(X8,X0,X9) | ~product(X3,X0,X7) | ~sum(X1,X3,X8) | ~product(X1,X0,X6)).
% 13.19/14.21
% 13.19/14.21 cnf(distributivity4,axiom,
% 13.19/14.21 product(X8,X0,X9) | ~product(X3,X0,X7) | ~sum(X6,X7,X9) | ~sum(X1,X3,X8) | ~product(X1,X0,X6)).
% 13.19/14.21
% 13.19/14.21 % # SZS output end Saturation.
% 13.19/14.21 % ------------------------------
% 13.19/14.21 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.19/14.21 % Termination reason: Satisfiable
% 13.19/14.21
% 13.19/14.21 % Input clauses: 17
% 13.19/14.21 % Initial clauses: 17
% 13.19/14.21 %
% 13.19/14.21 % SAT solver clauses: 108
% 13.19/14.21 % SAT solver unit clauses: 28
% 13.19/14.21 % SAT solver binary clauses: 20
% 13.19/14.21 %
% 13.19/14.21 % InstGen kept clauses: 50
% 13.19/14.21 % InstGen iterations: 3
% 13.19/14.21 %
% 13.19/14.21 % TWLsolver clauses: 74
% 13.19/14.21 % TWLsolver calls for satisfiability: 870
% 13.19/14.21 %
% 13.19/14.21 % Memory used [KB]: 767
% 13.19/14.21 % Time elapsed: 0.002 s
% 13.19/14.21 % ------------------------------
% 13.19/14.21 ---- Runtime statistics ----
% 13.19/14.21 clauses created: 44
% 13.19/14.21 -----------------------------
% 13.19/14.21 % ------------------------------
% 13.19/14.21 % Success in time 13.124 s
%------------------------------------------------------------------------------