TMTP Model File: BOO037-1.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : BOO037-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n163.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 : Wed Jul 8 09:59:56 EDT 2015
% Result : Satisfiable 13.10s
% Output : Saturation 13.10s
% Verified :
% Statistics : Number of clauses : 30 ( 30 expanded)
% Number of leaves : 30 ( 30 expanded)
% Depth : 0
% Number of atoms : 84 ( 84 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(u53,axiom,
( sQ0_eqProxy(X0,X0) )).
cnf(additive_identity1,axiom,
( sum(additive_identity,X0,X0) )).
cnf(additive_identity2,axiom,
( sum(X0,additive_identity,X0) )).
cnf(multiplicative_identity1,axiom,
( product(multiplicative_identity,X0,X0) )).
cnf(multiplicative_identity2,axiom,
( product(X0,multiplicative_identity,X0) )).
cnf(additive_inverse1,axiom,
( sum(inverse(X0),X0,multiplicative_identity) )).
cnf(additive_inverse2,axiom,
( sum(X0,inverse(X0),multiplicative_identity) )).
cnf(multiplicative_inverse1,axiom,
( product(inverse(X0),X0,additive_identity) )).
cnf(multiplicative_inverse2,axiom,
( product(X0,inverse(X0),additive_identity) )).
cnf(closure_of_addition,axiom,
( sum(X0,X1,add(X0,X1)) )).
cnf(closure_of_multiplication,axiom,
( product(X0,X1,multiply(X0,X1)) )).
cnf(u54,axiom,
( sQ0_eqProxy(X1,X0)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(commutativity_of_addition,axiom,
( sum(X1,X0,X2)
| ~ sum(X0,X1,X2) )).
cnf(commutativity_of_multiplication,axiom,
( product(X1,X0,X2)
| ~ product(X0,X1,X2) )).
cnf(u50,axiom,
( sQ0_eqProxy(inverse(X0),inverse(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u55,axiom,
( sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u46,axiom,
( sQ0_eqProxy(X7,X8)
| ~ sum(X0,X1,X8)
| ~ sum(X0,X1,X7) )).
cnf(u47,axiom,
( sQ0_eqProxy(X7,X8)
| ~ product(X0,X1,X8)
| ~ product(X0,X1,X7) )).
cnf(u48,axiom,
( sQ0_eqProxy(add(X0,X2),add(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u49,axiom,
( sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u51,axiom,
( sum(X1,X3,X5)
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X4,X5)
| ~ sum(X0,X2,X4)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u52,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(X3,X4,X6)
| ~ product(X0,X5,X6)
| ~ sum(X1,X2,X5)
| ~ product(X0,X2,X4)
| ~ product(X0,X1,X3) )).
cnf(distributivity2,axiom,
( product(X0,X5,X6)
| ~ sum(X3,X4,X6)
| ~ sum(X1,X2,X5)
| ~ product(X0,X2,X4)
| ~ product(X0,X1,X3) )).
cnf(distributivity3,axiom,
( sum(X3,X4,X6)
| ~ product(X5,X0,X6)
| ~ sum(X1,X2,X5)
| ~ product(X2,X0,X4)
| ~ product(X1,X0,X3) )).
cnf(distributivity4,axiom,
( product(X5,X0,X6)
| ~ sum(X3,X4,X6)
| ~ sum(X1,X2,X5)
| ~ product(X2,X0,X4)
| ~ product(X1,X0,X3) )).
cnf(distributivity5,axiom,
( product(X3,X4,X6)
| ~ sum(X0,X5,X6)
| ~ product(X1,X2,X5)
| ~ sum(X0,X2,X4)
| ~ sum(X0,X1,X3) )).
cnf(distributivity6,axiom,
( sum(X0,X5,X6)
| ~ product(X3,X4,X6)
| ~ product(X1,X2,X5)
| ~ sum(X0,X2,X4)
| ~ sum(X0,X1,X3) )).
cnf(distributivity7,axiom,
( product(X3,X4,X6)
| ~ sum(X5,X0,X6)
| ~ product(X1,X2,X5)
| ~ sum(X2,X0,X4)
| ~ sum(X1,X0,X3) )).
cnf(distributivity8,axiom,
( sum(X5,X0,X6)
| ~ product(X3,X4,X6)
| ~ product(X1,X2,X5)
| ~ sum(X2,X0,X4)
| ~ sum(X1,X0,X3) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO037-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : vampire --mode casc -t %d %s
% 0.02/1.07 % Computer : n163.star.cs.uiowa.edu
% 0.02/1.07 % Model : x86_64 x86_64
% 0.02/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/1.07 % Memory : 32286.75MB
% 0.02/1.07 % OS : Linux 2.6.32-504.23.4.el6.x86_64
% 0.02/1.07 % CPULimit : 300
% 0.02/1.07 % DateTime : Tue Jul 7 12:50:43 CDT 2015
% 0.02/1.07 % CPUTime :
% 0.02/1.07 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.02/1.07 % remaining time: 3000 next slice time: 130
% 0.02/1.08 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.10/14.18 % (36250)Time limit reached!
% 13.10/14.18 % ------------------------------
% 13.10/14.18 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.10/14.18 % Termination reason: Time limit
% 13.10/14.18 % Termination phase: Saturation
% 13.10/14.18
% 13.10/14.18 % Active clauses: 2635
% 13.10/14.18 % Passive clauses: 33542
% 13.10/14.18 % Generated clauses: 677434
% 13.10/14.18 % Final active clauses: 2043
% 13.10/14.18 % Final passive clauses: 6255
% 13.10/14.18 % Input clauses: 22
% 13.10/14.18 % Initial clauses: 22
% 13.10/14.18 % Discarded non-redundant clauses: 366061
% 13.10/14.18 %
% 13.10/14.18 % Fw subsumption resolutions: 45
% 13.10/14.18 % Fw demodulations: 275647
% 13.10/14.18 % Bw demodulations: 6517
% 13.10/14.18 %
% 13.10/14.18 % Simple tautologies: 1083
% 13.10/14.18 % Equational tautologies: 1183
% 13.10/14.18 % Forward subsumptions: 363846
% 13.10/14.18 % Fw demodulations to eq. taut.: 1894
% 13.10/14.18 %
% 13.10/14.18 % Binary resolution: 87364
% 13.10/14.18 % Forward superposition: 189344
% 13.10/14.18 % Backward superposition: 118342
% 13.10/14.18 % Self superposition: 153
% 13.10/14.18 %
% 13.10/14.18 % SAT solver clauses: 33543
% 13.10/14.18 % SAT solver unit clauses: 16084
% 13.10/14.18 % SAT solver binary clauses: 12870
% 13.10/14.18 %
% 13.10/14.18 % Memory used [KB]: 236158
% 13.10/14.18 % Time elapsed: 13.100 s
% 13.10/14.18 % ------------------------------
% 13.10/14.18 ---- Runtime statistics ----
% 13.10/14.18 binary resolutions skipped for weight limit before building clause: 2714
% 13.10/14.18 binary resolutions skipped for weight limit while building clause: 41321
% 13.10/14.18 clauses created: 744630
% 13.10/14.18 clauses deleted: 706288
% 13.10/14.18 clauses discarded by weight limit in forward simplification: 143
% 13.10/14.18 clauses discarded from active on weight limit update: 270
% 13.10/14.18 clauses discarded from passive on weight limit update: 18457
% 13.10/14.18 superpositions skipped for weight limit while constructing other literals: 25872
% 13.10/14.18 superpositions weight skipped after rewrited literal weight retrieval: 277284
% 13.10/14.18 -----------------------------
% 13.10/14.18 % ------------------------------
% 13.10/14.19 % remaining time: 2868 next slice time: 4
% 13.10/14.19 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.10/14.19 % SZS status Satisfiable for theBenchmark
% 13.10/14.19 Satisfiable!
% 13.10/14.19 % # SZS output start Saturation.
% 13.10/14.19 cnf(u53,axiom,
% 13.10/14.19 sQ0_eqProxy(X0,X0)).
% 13.10/14.19
% 13.10/14.19 cnf(additive_identity1,axiom,
% 13.10/14.19 sum(additive_identity,X0,X0)).
% 13.10/14.19
% 13.10/14.19 cnf(additive_identity2,axiom,
% 13.10/14.19 sum(X0,additive_identity,X0)).
% 13.10/14.19
% 13.10/14.19 cnf(multiplicative_identity1,axiom,
% 13.10/14.19 product(multiplicative_identity,X0,X0)).
% 13.10/14.19
% 13.10/14.19 cnf(multiplicative_identity2,axiom,
% 13.10/14.19 product(X0,multiplicative_identity,X0)).
% 13.10/14.19
% 13.10/14.19 cnf(additive_inverse1,axiom,
% 13.10/14.19 sum(inverse(X0),X0,multiplicative_identity)).
% 13.10/14.19
% 13.10/14.19 cnf(additive_inverse2,axiom,
% 13.10/14.19 sum(X0,inverse(X0),multiplicative_identity)).
% 13.10/14.19
% 13.10/14.19 cnf(multiplicative_inverse1,axiom,
% 13.10/14.19 product(inverse(X0),X0,additive_identity)).
% 13.10/14.19
% 13.10/14.19 cnf(multiplicative_inverse2,axiom,
% 13.10/14.19 product(X0,inverse(X0),additive_identity)).
% 13.10/14.19
% 13.10/14.19 cnf(closure_of_addition,axiom,
% 13.10/14.19 sum(X0,X1,add(X0,X1))).
% 13.10/14.19
% 13.10/14.19 cnf(closure_of_multiplication,axiom,
% 13.10/14.19 product(X0,X1,multiply(X0,X1))).
% 13.10/14.19
% 13.10/14.19 cnf(u54,axiom,
% 13.10/14.19 sQ0_eqProxy(X1,X0) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(commutativity_of_addition,axiom,
% 13.10/14.19 sum(X1,X0,X2) | ~sum(X0,X1,X2)).
% 13.10/14.19
% 13.10/14.19 cnf(commutativity_of_multiplication,axiom,
% 13.10/14.19 product(X1,X0,X2) | ~product(X0,X1,X2)).
% 13.10/14.19
% 13.10/14.19 cnf(u50,axiom,
% 13.10/14.19 sQ0_eqProxy(inverse(X0),inverse(X1)) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(u55,axiom,
% 13.10/14.19 sQ0_eqProxy(X0,X2) | ~sQ0_eqProxy(X1,X2) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(u46,axiom,
% 13.10/14.19 sQ0_eqProxy(X7,X8) | ~sum(X0,X1,X8) | ~sum(X0,X1,X7)).
% 13.10/14.19
% 13.10/14.19 cnf(u47,axiom,
% 13.10/14.19 sQ0_eqProxy(X7,X8) | ~product(X0,X1,X8) | ~product(X0,X1,X7)).
% 13.10/14.19
% 13.10/14.19 cnf(u48,axiom,
% 13.10/14.19 sQ0_eqProxy(add(X0,X2),add(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(u49,axiom,
% 13.10/14.19 sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(u51,axiom,
% 13.10/14.19 sum(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~sum(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(u52,axiom,
% 13.10/14.19 product(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~product(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity1,axiom,
% 13.10/14.19 sum(X3,X4,X6) | ~product(X0,X5,X6) | ~sum(X1,X2,X5) | ~product(X0,X2,X4) | ~product(X0,X1,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity2,axiom,
% 13.10/14.19 product(X0,X5,X6) | ~sum(X3,X4,X6) | ~sum(X1,X2,X5) | ~product(X0,X2,X4) | ~product(X0,X1,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity3,axiom,
% 13.10/14.19 sum(X3,X4,X6) | ~product(X5,X0,X6) | ~sum(X1,X2,X5) | ~product(X2,X0,X4) | ~product(X1,X0,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity4,axiom,
% 13.10/14.19 product(X5,X0,X6) | ~sum(X3,X4,X6) | ~sum(X1,X2,X5) | ~product(X2,X0,X4) | ~product(X1,X0,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity5,axiom,
% 13.10/14.19 product(X3,X4,X6) | ~sum(X0,X5,X6) | ~product(X1,X2,X5) | ~sum(X0,X2,X4) | ~sum(X0,X1,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity6,axiom,
% 13.10/14.19 sum(X0,X5,X6) | ~product(X3,X4,X6) | ~product(X1,X2,X5) | ~sum(X0,X2,X4) | ~sum(X0,X1,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity7,axiom,
% 13.10/14.19 product(X3,X4,X6) | ~sum(X5,X0,X6) | ~product(X1,X2,X5) | ~sum(X2,X0,X4) | ~sum(X1,X0,X3)).
% 13.10/14.19
% 13.10/14.19 cnf(distributivity8,axiom,
% 13.10/14.19 sum(X5,X0,X6) | ~product(X3,X4,X6) | ~product(X1,X2,X5) | ~sum(X2,X0,X4) | ~sum(X1,X0,X3)).
% 13.10/14.19
% 13.10/14.19 % # SZS output end Saturation.
% 13.10/14.19 % ------------------------------
% 13.10/14.19 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.10/14.19 % Termination reason: Satisfiable
% 13.10/14.19
% 13.10/14.19 % Input clauses: 22
% 13.10/14.19 % Initial clauses: 22
% 13.10/14.19 %
% 13.10/14.19 % SAT solver clauses: 128
% 13.10/14.19 % SAT solver unit clauses: 44
% 13.10/14.19 % SAT solver binary clauses: 24
% 13.10/14.19 %
% 13.10/14.19 % InstGen kept clauses: 60
% 13.10/14.19 % InstGen iterations: 3
% 13.10/14.19 %
% 13.10/14.19 % TWLsolver clauses: 92
% 13.10/14.19 % TWLsolver calls for satisfiability: 1016
% 13.10/14.19 %
% 13.10/14.19 % Memory used [KB]: 767
% 13.10/14.19 % Time elapsed: 0.002 s
% 13.10/14.19 % ------------------------------
% 13.10/14.19 ---- Runtime statistics ----
% 13.10/14.19 clauses created: 54
% 13.10/14.19 -----------------------------
% 13.10/14.19 % ------------------------------
% 13.10/14.19 % Success in time 13.122 s
%------------------------------------------------------------------------------