TMTP Model File: GRP392-1.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : GRP392-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n171.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 11:07:53 EDT 2015
% Result : Satisfiable 13.09s
% Output : Saturation 13.09s
% Verified :
% Statistics : Number of clauses : 11 ( 11 expanded)
% Number of leaves : 11 ( 11 expanded)
% Depth : 0
% Number of atoms : 28 ( 28 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(u17,axiom,
( sQ0_eqProxy(X0,X0) )).
cnf(left_identity,axiom,
( product(identity,X0,X0) )).
cnf(right_identity,axiom,
( product(X0,identity,X0) )).
cnf(total_function1,axiom,
( product(X0,X1,multiply(X0,X1)) )).
cnf(u18,axiom,
( sQ0_eqProxy(X1,X0)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u19,axiom,
( sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u14,axiom,
( sQ0_eqProxy(X2,X3)
| ~ product(X0,X1,X3)
| ~ product(X0,X1,X2) )).
cnf(u15,axiom,
( sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3))
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(associativity1,axiom,
( product(X0,X5,X3)
| ~ product(X4,X2,X3)
| ~ product(X1,X2,X5)
| ~ product(X0,X1,X4) )).
cnf(associativity2,axiom,
( product(X4,X2,X3)
| ~ product(X0,X5,X3)
| ~ product(X1,X2,X5)
| ~ product(X0,X1,X4) )).
cnf(u16,axiom,
( product(X1,X3,X5)
| ~ sQ0_eqProxy(X2,X3)
| ~ sQ0_eqProxy(X4,X5)
| ~ product(X0,X2,X4)
| ~ sQ0_eqProxy(X0,X1) )).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP392-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 : n171.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 10:54:13 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.09/14.18 % (29318)Time limit reached!
% 13.09/14.18 % ------------------------------
% 13.09/14.18 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.09/14.18 % Termination reason: Time limit
% 13.09/14.18 % Termination phase: Saturation
% 13.09/14.18
% 13.09/14.18 % Active clauses: 330
% 13.09/14.18 % Passive clauses: 919
% 13.09/14.18 % Generated clauses: 301130
% 13.09/14.18 % Final active clauses: 329
% 13.09/14.18 % Final passive clauses: 487
% 13.09/14.18 % Input clauses: 6
% 13.09/14.18 % Initial clauses: 6
% 13.09/14.18 % Discarded non-redundant clauses: 2290
% 13.09/14.18 %
% 13.09/14.18 % Fw demodulations: 259278
% 13.09/14.18 % Bw demodulations: 4
% 13.09/14.18 %
% 13.09/14.18 % Simple tautologies: 99
% 13.09/14.18 % Equational tautologies: 18
% 13.09/14.18 % Forward subsumptions: 37896
% 13.09/14.18 % Fw demodulations to eq. taut.: 1761
% 13.09/14.18 %
% 13.09/14.18 % Binary resolution: 4716
% 13.09/14.18 % Forward superposition: 27329
% 13.09/14.18 % Backward superposition: 9706
% 13.09/14.18 % Self superposition: 91
% 13.09/14.18 %
% 13.09/14.18 % SAT solver clauses: 920
% 13.09/14.18 % SAT solver unit clauses: 52
% 13.09/14.18 % SAT solver binary clauses: 816
% 13.09/14.18 %
% 13.09/14.18 % Memory used [KB]: 237949
% 13.09/14.18 % Time elapsed: 13.100 s
% 13.09/14.18 % ------------------------------
% 13.09/14.18 ---- Runtime statistics ----
% 13.09/14.18 binary resolutions skipped for weight limit while building clause: 43
% 13.09/14.18 clauses created: 302927
% 13.09/14.18 clauses deleted: 296294
% 13.09/14.18 clauses discarded by weight limit in forward simplification: 47
% 13.09/14.18 clauses discarded from passive on weight limit update: 99
% 13.09/14.18 superpositions skipped for weight limit while constructing other literals: 1754
% 13.09/14.18 superpositions weight skipped after rewrited literal weight retrieval: 347
% 13.09/14.18 -----------------------------
% 13.09/14.18 % ------------------------------
% 13.09/14.19 % remaining time: 2868 next slice time: 4
% 13.09/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.09/14.19 % SZS status Satisfiable for theBenchmark
% 13.09/14.19 Satisfiable!
% 13.09/14.19 % # SZS output start Saturation.
% 13.09/14.19 cnf(u17,axiom,
% 13.09/14.19 sQ0_eqProxy(X0,X0)).
% 13.09/14.19
% 13.09/14.19 cnf(left_identity,axiom,
% 13.09/14.19 product(identity,X0,X0)).
% 13.09/14.19
% 13.09/14.19 cnf(right_identity,axiom,
% 13.09/14.19 product(X0,identity,X0)).
% 13.09/14.19
% 13.09/14.19 cnf(total_function1,axiom,
% 13.09/14.19 product(X0,X1,multiply(X0,X1))).
% 13.09/14.19
% 13.09/14.19 cnf(u18,axiom,
% 13.09/14.19 sQ0_eqProxy(X1,X0) | ~sQ0_eqProxy(X0,X1)).
% 13.09/14.19
% 13.09/14.19 cnf(u19,axiom,
% 13.09/14.19 sQ0_eqProxy(X0,X2) | ~sQ0_eqProxy(X1,X2) | ~sQ0_eqProxy(X0,X1)).
% 13.09/14.19
% 13.09/14.19 cnf(u14,axiom,
% 13.09/14.19 sQ0_eqProxy(X2,X3) | ~product(X0,X1,X3) | ~product(X0,X1,X2)).
% 13.09/14.19
% 13.09/14.19 cnf(u15,axiom,
% 13.09/14.19 sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.09/14.19
% 13.09/14.19 cnf(associativity1,axiom,
% 13.09/14.19 product(X0,X5,X3) | ~product(X4,X2,X3) | ~product(X1,X2,X5) | ~product(X0,X1,X4)).
% 13.09/14.19
% 13.09/14.19 cnf(associativity2,axiom,
% 13.09/14.19 product(X4,X2,X3) | ~product(X0,X5,X3) | ~product(X1,X2,X5) | ~product(X0,X1,X4)).
% 13.09/14.19
% 13.09/14.19 cnf(u16,axiom,
% 13.09/14.19 product(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~product(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.09/14.19
% 13.09/14.19 % # SZS output end Saturation.
% 13.09/14.19 % ------------------------------
% 13.09/14.19 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.09/14.19 % Termination reason: Satisfiable
% 13.09/14.19
% 13.09/14.19 % Input clauses: 6
% 13.09/14.19 % Initial clauses: 6
% 13.09/14.19 %
% 13.09/14.19 % SAT solver clauses: 48
% 13.09/14.19 % SAT solver unit clauses: 16
% 13.09/14.19 % SAT solver binary clauses: 8
% 13.09/14.19 %
% 13.09/14.19 % InstGen kept clauses: 22
% 13.09/14.19 % InstGen iterations: 2
% 13.09/14.19 %
% 13.09/14.19 % TWLsolver clauses: 34
% 13.09/14.19 % TWLsolver calls for satisfiability: 281
% 13.09/14.19 %
% 13.09/14.19 % Memory used [KB]: 767
% 13.09/14.19 % Time elapsed: 0.002 s
% 13.09/14.19 % ------------------------------
% 13.09/14.19 ---- Runtime statistics ----
% 13.09/14.19 clauses created: 18
% 13.09/14.19 -----------------------------
% 13.09/14.19 % ------------------------------
% 13.09/14.19 % Success in time 13.12 s
%------------------------------------------------------------------------------