TMTP Model File: GRP398-2.003-Sat
View Problem
- Process Model
%------------------------------------------------------------------------------
% File : Vampire---4.0
% Problem : GRP398-2 : TPTP v6.2.0. Released v2.5.0.
% Transform : none
% Format : tptp:raw
% Command : vampire --mode casc -t %d %s
% Computer : n167.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:54 EDT 2015
% Result : Satisfiable 13.18s
% Output : Saturation 13.18s
% Verified :
% Statistics : Number of clauses : 16 ( 16 expanded)
% Number of leaves : 16 ( 16 expanded)
% Depth : 0
% Number of atoms : 39 ( 39 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(u25,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(u26,axiom,
( sQ0_eqProxy(X1,X0)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u24,axiom,
( ~ subgroup_member(X0)
| ~ sQ0_eqProxy(X0,X1)
| subgroup_member(X1) )).
cnf(u21,axiom,
( sQ0_eqProxy(inverse(X0),inverse(X1))
| ~ sQ0_eqProxy(X0,X1) )).
cnf(u27,axiom,
( sQ0_eqProxy(X0,X2)
| ~ sQ0_eqProxy(X1,X2)
| ~ sQ0_eqProxy(X0,X1) )).
cnf(closure_of_product_and_inverse,axiom,
( ~ subgroup_member(X7)
| ~ subgroup_member(X6)
| ~ product(X6,inverse(X7),X8)
| subgroup_member(X8) )).
cnf(u20,axiom,
( sQ0_eqProxy(X2,X3)
| ~ product(X0,X1,X3)
| ~ product(X0,X1,X2) )).
cnf(u22,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(u23,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 : GRP398-2 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.03 % Command : vampire --mode casc -t %d %s
% 0.02/1.08 % Computer : n167.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 10:54:18 CDT 2015
% 0.02/1.08 % CPUTime :
% 0.02/1.08 Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.02/1.08 % remaining time: 3000 next slice time: 130
% 0.02/1.09 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 % (20137)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: 2007
% 13.08/14.19 % Passive clauses: 10153
% 13.08/14.19 % Generated clauses: 542799
% 13.08/14.19 % Final active clauses: 1989
% 13.08/14.19 % Final passive clauses: 3776
% 13.08/14.19 % Input clauses: 9
% 13.08/14.19 % Initial clauses: 9
% 13.08/14.19 % Discarded non-redundant clauses: 214663
% 13.08/14.19 %
% 13.08/14.19 % Fw demodulations: 357223
% 13.08/14.19 % Bw demodulations: 186
% 13.08/14.19 %
% 13.08/14.19 % Simple tautologies: 1368
% 13.08/14.19 % Equational tautologies: 68
% 13.08/14.19 % Forward subsumptions: 170820
% 13.08/14.19 % Fw demodulations to eq. taut.: 2638
% 13.08/14.19 %
% 13.08/14.19 % Binary resolution: 40831
% 13.08/14.19 % Forward superposition: 104241
% 13.08/14.19 % Backward superposition: 40364
% 13.08/14.19 % Self superposition: 107
% 13.08/14.19 %
% 13.08/14.19 % SAT solver clauses: 10154
% 13.08/14.19 % SAT solver unit clauses: 1206
% 13.08/14.19 % SAT solver binary clauses: 8741
% 13.08/14.19 %
% 13.08/14.19 % Memory used [KB]: 244345
% 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 while building clause: 13450
% 13.08/14.19 clauses created: 646784
% 13.08/14.19 clauses deleted: 629409
% 13.08/14.19 clauses discarded by weight limit in forward simplification: 529
% 13.08/14.19 clauses discarded from active on weight limit update: 13
% 13.08/14.19 clauses discarded from passive on weight limit update: 4189
% 13.08/14.19 superpositions skipped for weight limit while constructing other literals: 90373
% 13.08/14.19 superpositions weight skipped after rewrited literal weight retrieval: 105844
% 13.08/14.19 superpositions weight skipped early: 265
% 13.08/14.19 -----------------------------
% 13.08/14.19 % ------------------------------
% 13.08/14.20 % remaining time: 2868 next slice time: 4
% 13.08/14.20 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.18/14.30 % SZS status Satisfiable for theBenchmark
% 13.18/14.30 Satisfiable!
% 13.18/14.30 % # SZS output start Saturation.
% 13.18/14.30 cnf(u25,axiom,
% 13.18/14.30 sQ0_eqProxy(X0,X0)).
% 13.18/14.30
% 13.18/14.30 cnf(left_identity,axiom,
% 13.18/14.30 product(identity,X0,X0)).
% 13.18/14.30
% 13.18/14.30 cnf(right_identity,axiom,
% 13.18/14.30 product(X0,identity,X0)).
% 13.18/14.30
% 13.18/14.30 cnf(left_inverse,axiom,
% 13.18/14.30 product(inverse(X0),X0,identity)).
% 13.18/14.30
% 13.18/14.30 cnf(right_inverse,axiom,
% 13.18/14.30 product(X0,inverse(X0),identity)).
% 13.18/14.30
% 13.18/14.30 cnf(total_function1,axiom,
% 13.18/14.30 product(X0,X1,multiply(X0,X1))).
% 13.18/14.30
% 13.18/14.30 cnf(u26,axiom,
% 13.18/14.30 sQ0_eqProxy(X1,X0) | ~sQ0_eqProxy(X0,X1)).
% 13.18/14.30
% 13.18/14.30 cnf(u24,axiom,
% 13.18/14.30 ~subgroup_member(X0) | ~sQ0_eqProxy(X0,X1) | subgroup_member(X1)).
% 13.18/14.30
% 13.18/14.30 cnf(u21,axiom,
% 13.18/14.30 sQ0_eqProxy(inverse(X0),inverse(X1)) | ~sQ0_eqProxy(X0,X1)).
% 13.18/14.30
% 13.18/14.30 cnf(u27,axiom,
% 13.18/14.30 sQ0_eqProxy(X0,X2) | ~sQ0_eqProxy(X1,X2) | ~sQ0_eqProxy(X0,X1)).
% 13.18/14.30
% 13.18/14.30 cnf(closure_of_product_and_inverse,axiom,
% 13.18/14.30 ~subgroup_member(X7) | ~subgroup_member(X6) | ~product(X6,inverse(X7),X8) | subgroup_member(X8)).
% 13.18/14.30
% 13.18/14.30 cnf(u20,axiom,
% 13.18/14.30 sQ0_eqProxy(X2,X3) | ~product(X0,X1,X3) | ~product(X0,X1,X2)).
% 13.18/14.30
% 13.18/14.30 cnf(u22,axiom,
% 13.18/14.30 sQ0_eqProxy(multiply(X0,X2),multiply(X1,X3)) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X0,X1)).
% 13.18/14.30
% 13.18/14.30 cnf(associativity1,axiom,
% 13.18/14.30 product(X0,X5,X3) | ~product(X4,X2,X3) | ~product(X1,X2,X5) | ~product(X0,X1,X4)).
% 13.18/14.30
% 13.18/14.30 cnf(associativity2,axiom,
% 13.18/14.30 product(X4,X2,X3) | ~product(X0,X5,X3) | ~product(X1,X2,X5) | ~product(X0,X1,X4)).
% 13.18/14.30
% 13.18/14.30 cnf(u23,axiom,
% 13.18/14.30 product(X1,X3,X5) | ~sQ0_eqProxy(X2,X3) | ~sQ0_eqProxy(X4,X5) | ~product(X0,X2,X4) | ~sQ0_eqProxy(X0,X1)).
% 13.18/14.30
% 13.18/14.30 % # SZS output end Saturation.
% 13.18/14.30 % ------------------------------
% 13.18/14.30 % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 13.18/14.30 % Termination reason: Satisfiable
% 13.18/14.30
% 13.18/14.30 % Active clauses: 38
% 13.18/14.30 % Passive clauses: 88
% 13.18/14.30 % Generated clauses: 185
% 13.18/14.30 % Input clauses: 9
% 13.18/14.30 % Initial clauses: 9
% 13.18/14.30 %
% 13.18/14.30 % Duplicate literals: 13
% 13.18/14.30 % Fw demodulations: 29
% 13.18/14.30 % Global subsumptions: 273
% 13.18/14.30 %
% 13.18/14.30 % Simple tautologies: 72
% 13.18/14.30 % Equational tautologies: 7
% 13.18/14.30 % Forward subsumptions: 65
% 13.18/14.30 %
% 13.18/14.30 % Binary resolution: 124
% 13.18/14.30 % Forward superposition: 10
% 13.18/14.30 % Backward superposition: 14
% 13.18/14.30 %
% 13.18/14.30 % SAT solver clauses: 5779
% 13.18/14.30 % SAT solver unit clauses: 1198
% 13.18/14.30 % SAT solver binary clauses: 1116
% 13.18/14.30 % SAT solver learnt clauses: 561
% 13.18/14.30 % SAT solver learnt literals: 527
% 13.18/14.30 %
% 13.18/14.30 % InstGen generated clauses: 4192
% 13.18/14.30 % InstGen redundant clauses: 3097
% 13.18/14.30 % InstGen kept clauses: 2053
% 13.18/14.30 % InstGen iterations: 22
% 13.18/14.30 %
% 13.18/14.30 % TWLsolver clauses: 4300
% 13.18/14.30 % TWLsolver calls for satisfiability: 45699
% 13.18/14.30 %
% 13.18/14.30 % Memory used [KB]: 4221
% 13.18/14.30 % Time elapsed: 0.095 s
% 13.18/14.30 % ------------------------------
% 13.18/14.30 ---- Runtime statistics ----
% 13.18/14.30 clauses created: 4692
% 13.18/14.30 clauses deleted: 3196
% 13.18/14.30 -----------------------------
% 13.18/14.30 % ------------------------------
% 13.18/14.30 % Success in time 13.215 s
%------------------------------------------------------------------------------