TMTP Model File: GRP394-1.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : GRP394-1 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n160.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.07s
% Output : Saturation 13.07s
% Verified :
% Statistics : Number of clauses : 14 ( 14 expanded)
% Number of leaves : 14 ( 14 expanded)
% Depth : 0
% Number of atoms : 32 ( 32 expanded)
% Number of equality atoms : 0 ( 0 expanded)
% Maximal clause size : 5 ( 2 average)
% Maximal term depth : 2 ( 1 average)
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Vampire---4.0 format not known, defaulting to TPTP
cnf(u22,axiom,
( sQ0_eqProxy(X0,X0) )).
cnf(left_identity,axiom,
( product(identity,X0,X0) )).
cnf(right_identity,axiom,
( product(X0,identity,X0) )).
cnf(left_inverse,axiom,
( product(inverse(X0),X0,identity) )).
cnf(right_inverse,axiom,
( product(X0,inverse(X0),identity) )).
cnf(total_function1,axiom,
( product(X0,X1,multiply(X0,X1)) )).
cnf(u23,axiom,
( sQ0_eqProxy(X1,X0)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u19,axiom,
( sQ0_eqProxy(inverse(X0),inverse(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u24,axiom,
( sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u18,axiom,
( sQ0_eqProxy(X2,X3)
| ~ product(X0,X1,X3)
| ~ product(X0,X1,X2) )).
cnf(u20,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(u21,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 : GRP394-1 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.04 % Command : vampire --mode casc -t %d %s
% 0.02/1.07 % Computer : n160.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.07/14.18 % (38979)Time limit reached!
% 13.07/14.18 % ------------------------------
% 13.07/14.18 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.07/14.18 % Termination reason: Time limit
% 13.07/14.18 % Termination phase: Saturation
% 13.07/14.18
% 13.07/14.18 % Active clauses: 2009
% 13.07/14.18 % Passive clauses: 10125
% 13.07/14.18 % Generated clauses: 544322
% 13.07/14.18 % Final active clauses: 1992
% 13.07/14.18 % Final passive clauses: 3773
% 13.07/14.18 % Input clauses: 8
% 13.07/14.18 % Initial clauses: 8
% 13.07/14.18 % Discarded non-redundant clauses: 214700
% 13.07/14.18 %
% 13.07/14.18 % Fw demodulations: 358767
% 13.07/14.18 % Bw demodulations: 176
% 13.07/14.18 %
% 13.07/14.18 % Simple tautologies: 1366
% 13.07/14.18 % Equational tautologies: 68
% 13.07/14.18 % Forward subsumptions: 170853
% 13.07/14.18 % Fw demodulations to eq. taut.: 2642
% 13.07/14.18 %
% 13.07/14.18 % Binary resolution: 40760
% 13.07/14.18 % Forward superposition: 104099
% 13.07/14.18 % Backward superposition: 40568
% 13.07/14.18 % Self superposition: 107
% 13.07/14.18 %
% 13.07/14.18 % SAT solver clauses: 10126
% 13.07/14.18 % SAT solver unit clauses: 1193
% 13.07/14.18 % SAT solver binary clauses: 8729
% 13.07/14.18 %
% 13.07/14.18 % Memory used [KB]: 244729
% 13.07/14.18 % Time elapsed: 13.100 s
% 13.07/14.18 % ------------------------------
% 13.07/14.18 ---- Runtime statistics ----
% 13.07/14.18 binary resolutions skipped for weight limit while building clause: 13237
% 13.07/14.18 clauses created: 648364
% 13.07/14.18 clauses deleted: 631042
% 13.07/14.18 clauses discarded by weight limit in forward simplification: 501
% 13.07/14.18 clauses discarded from active on weight limit update: 12
% 13.07/14.18 clauses discarded from passive on weight limit update: 4172
% 13.07/14.18 superpositions skipped for weight limit while constructing other literals: 90642
% 13.07/14.18 superpositions weight skipped after rewrited literal weight retrieval: 105861
% 13.07/14.18 superpositions weight skipped early: 275
% 13.07/14.18 -----------------------------
% 13.07/14.18 % ------------------------------
% 13.07/14.19 % remaining time: 2868 next slice time: 4
% 13.07/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.07/14.20 % SZS status Satisfiable for theBenchmark
% 13.07/14.20 Satisfiable!
% 13.07/14.20 % # SZS output start Saturation.
% 13.07/14.20 cnf(u22,axiom,
% 13.07/14.20 sQ0_eqProxy(X0,X0)).
% 13.07/14.20
% 13.07/14.20 cnf(left_identity,axiom,
% 13.07/14.20 product(identity,X0,X0)).
% 13.07/14.20
% 13.07/14.20 cnf(right_identity,axiom,
% 13.07/14.20 product(X0,identity,X0)).
% 13.07/14.20
% 13.07/14.20 cnf(left_inverse,axiom,
% 13.07/14.20 product(inverse(X0),X0,identity)).
% 13.07/14.20
% 13.07/14.20 cnf(right_inverse,axiom,
% 13.07/14.20 product(X0,inverse(X0),identity)).
% 13.07/14.20
% 13.07/14.20 cnf(total_function1,axiom,
% 13.07/14.20 product(X0,X1,multiply(X0,X1))).
% 13.07/14.20
% 13.07/14.20 cnf(u23,axiom,
% 13.07/14.20 sQ0_eqProxy(X1,X0) | ~sQ0_eqProxy(X0,X1)).
% 13.07/14.20
% 13.07/14.20 cnf(u19,axiom,
% 13.07/14.20 sQ0_eqProxy(inverse(X0),inverse(X1)) | ~sQ0_eqProxy(X0,X1)).
% 13.07/14.20
% 13.07/14.20 cnf(u24,axiom,
% 13.07/14.20 sQ0_eqProxy(X0,X2) | ~sQ0_eqProxy(X1,X2) | ~sQ0_eqProxy(X0,X1)).
% 13.07/14.20
% 13.07/14.20 cnf(u18,axiom,
% 13.07/14.20 sQ0_eqProxy(X2,X3) | ~product(X0,X1,X3) | ~product(X0,X1,X2)).
% 13.07/14.20
% 13.07/14.20 cnf(u20,axiom,
% 13.07/14.20 sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.07/14.20
% 13.07/14.20 cnf(associativity1,axiom,
% 13.07/14.20 product(X0,X5,X3) | ~product(X4,X2,X3) | ~product(X1,X2,X5) | ~product(X0,X1,X4)).
% 13.07/14.20
% 13.07/14.20 cnf(associativity2,axiom,
% 13.07/14.20 product(X4,X2,X3) | ~product(X0,X5,X3) | ~product(X1,X2,X5) | ~product(X0,X1,X4)).
% 13.07/14.20
% 13.07/14.20 cnf(u21,axiom,
% 13.07/14.20 product(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~product(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.07/14.20
% 13.07/14.20 % # SZS output end Saturation.
% 13.07/14.20 % ------------------------------
% 13.07/14.20 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.07/14.20 % Termination reason: Satisfiable
% 13.07/14.20
% 13.07/14.20 % Input clauses: 8
% 13.07/14.20 % Initial clauses: 8
% 13.07/14.20 %
% 13.07/14.20 % SAT solver clauses: 60
% 13.07/14.20 % SAT solver unit clauses: 24
% 13.07/14.20 % SAT solver binary clauses: 12
% 13.07/14.20 %
% 13.07/14.20 % InstGen kept clauses: 28
% 13.07/14.20 % InstGen iterations: 2
% 13.07/14.20 %
% 13.07/14.20 % TWLsolver clauses: 46
% 13.07/14.20 % TWLsolver calls for satisfiability: 295
% 13.07/14.20 %
% 13.07/14.20 % Memory used [KB]: 767
% 13.07/14.20 % Time elapsed: 0.002 s
% 13.07/14.20 % ------------------------------
% 13.07/14.20 ---- Runtime statistics ----
% 13.07/14.20 clauses created: 23
% 13.07/14.20 -----------------------------
% 13.07/14.20 % ------------------------------
% 13.07/14.20 % Success in time 13.121 s
%------------------------------------------------------------------------------