TMTP Model File: HEN013-3.004-Sat

View Problem - Process Model

%------------------------------------------------------------------------------
% File       : Vampire---SAT-4.0
% Problem    : HEN013-3 : TPTP v6.2.0. Released v2.5.0.
% Transform  : none
% Format     : tptp:raw
% Command    : vampire --mode casc_sat -t %d %s

% Computer   : n175.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:10:41 EDT 2015

% Result     : Satisfiable 0.34s
% Output     : Saturation 0.34s
% Verified   : 
% Statistics : Number of clauses        :   10 (  10 expanded)
%              Number of leaves         :   10 (  10 expanded)
%              Depth                    :    0
%              Number of atoms          :   14 (  14 expanded)
%              Number of equality atoms :   14 (  14 expanded)
%              Maximal clause size      :    3 (   1 average)
%              Maximal term depth       :    2 (   1 average)

% Comments   : 
%------------------------------------------------------------------------------
%----WARNING: Vampire---SAT-4.0 format not known, defaulting to TPTP
cnf(u549,axiom,
    ( X0 = X1 )).

cnf(u491,axiom,
    ( zero = identity )).

cnf(u528,axiom,
    ( zero = X1 )).

cnf(u537,axiom,
    ( divide(X2,X3) = X2 )).

cnf(u492,axiom,
    ( divide(X0,zero) = zero )).

cnf(u138,axiom,
    ( divide(X1,X1) = zero )).

cnf(zero_is_smallest,axiom,
    ( divide(zero,X0) = zero )).

cnf(u14,axiom,
    ( divide(X0,zero) != zero
    | zero = X0 )).

cnf(u156,axiom,
    ( divide(X8,zero) != zero
    | divide(X8,X8) = X8 )).

cnf(divide_and_equal,axiom,
    ( divide(X0,X1) != zero
    | divide(X1,X0) != zero
    | X0 = X1 )).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : HEN013-3 : TPTP v6.2.0. Released v2.5.0.
% 0.00/0.04  % Command    : vampire --mode casc_sat -t %d %s
% 0.01/1.07  % Computer   : n175.star.cs.uiowa.edu
% 0.01/1.07  % Model      : x86_64 x86_64
% 0.01/1.07  % CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.01/1.07  % Memory     : 32286.75MB
% 0.01/1.07  % OS         : Linux 2.6.32-504.23.4.el6.x86_64
% 0.01/1.07  % CPULimit   : 300
% 0.01/1.07  % DateTime   : Tue Jul  7 11:24:57 CDT 2015
% 0.01/1.07  % CPUTime    : 
% 0.01/1.07  Hi Geoff, go and have some cold beer while I am trying to solve this very hard problem!
% 0.01/1.07  % remaining time: 3000 next slice time: 3
% 0.01/1.08  dis+10_3_cond=fast:fsr=off:gs=on:gsaa=full_model:gsssp=full:nwc=1:sac=on:sdd=large:sser=off:sfr=on:ssfp=10000:ssfq=1.2:ssnc=none:sp=occurrence_1 on theBenchmark
% 0.34/1.48  % (6943)Time limit reached!
% 0.34/1.48  % ------------------------------
% 0.34/1.48  % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.34/1.48  % Termination reason: Time limit
% 0.34/1.48  % Termination phase: Saturation
% 0.34/1.48  
% 0.34/1.48  % Active clauses: 99
% 0.34/1.48  % Passive clauses: 2851
% 0.34/1.48  % Generated clauses: 26615
% 0.34/1.48  % Final active clauses: 63
% 0.34/1.48  % Final passive clauses: 2525
% 0.34/1.48  % Input clauses: 5
% 0.34/1.48  % Initial clauses: 5
% 0.34/1.48  % 
% 0.34/1.48  % Trivial inequalities: 317
% 0.34/1.48  % Fw demodulations: 13764
% 0.34/1.48  % Bw demodulations: 36
% 0.34/1.48  % Global subsumptions: 42
% 0.34/1.48  % 
% 0.34/1.48  % Simple tautologies: 65
% 0.34/1.48  % Forward subsumptions: 9639
% 0.34/1.48  % Fw demodulations to eq. taut.: 2
% 0.34/1.48  % 
% 0.34/1.48  % Forward superposition: 6421
% 0.34/1.48  % Backward superposition: 5817
% 0.34/1.48  % Self superposition: 211
% 0.34/1.48  % Equality resolution: 2
% 0.34/1.48  % 
% 0.34/1.48  % SAT solver clauses: 3160
% 0.34/1.48  % SAT solver unit clauses: 2835
% 0.34/1.48  % SAT solver binary clauses: 236
% 0.34/1.48  % SAT solver learnt clauses: 84
% 0.34/1.48  % 
% 0.34/1.48  % TWLsolver clauses: 2992
% 0.34/1.48  % TWLsolver calls for satisfiability: 4040
% 0.34/1.48  % 
% 0.34/1.48  % Memory used [KB]: 16758
% 0.34/1.48  % Time elapsed: 0.400 s
% 0.34/1.48  % ------------------------------
% 0.34/1.48  ----  Runtime statistics ----
% 0.34/1.48  clauses created: 26620
% 0.34/1.48  clauses deleted: 19607
% 0.34/1.48  -----------------------------
% 0.34/1.48  % ------------------------------
% 0.34/1.48  % remaining time: 2995 next slice time: 10
% 0.34/1.49  ott+11_5_cond=on:er=filter:fsr=off:gs=on:gsaa=from_current:gsem=off:nwc=1:sac=on:sfr=on:ssfp=1000:ssfq=1.0:smm=sco:ssnc=none:updr=off_9 on theBenchmark
% 0.34/1.49  Satisfiable!
% 0.34/1.49  % SZS status Satisfiable for theBenchmark
% 0.34/1.49  % # SZS output start Saturation.
% 0.34/1.49  cnf(u549,axiom,
% 0.34/1.49      X0 = X1).
% 0.34/1.49  
% 0.34/1.49  cnf(u491,axiom,
% 0.34/1.49      zero = identity).
% 0.34/1.49  
% 0.34/1.49  cnf(u528,axiom,
% 0.34/1.49      zero = X1).
% 0.34/1.49  
% 0.34/1.49  cnf(u537,axiom,
% 0.34/1.49      divide(X2,X3) = X2).
% 0.34/1.49  
% 0.34/1.49  cnf(u492,axiom,
% 0.34/1.49      divide(X0,zero) = zero).
% 0.34/1.49  
% 0.34/1.49  cnf(u138,axiom,
% 0.34/1.49      divide(X1,X1) = zero).
% 0.34/1.49  
% 0.34/1.49  cnf(zero_is_smallest,axiom,
% 0.34/1.49      divide(zero,X0) = zero).
% 0.34/1.49  
% 0.34/1.49  cnf(u14,axiom,
% 0.34/1.49      divide(X0,zero) != zero | zero = X0).
% 0.34/1.49  
% 0.34/1.49  cnf(u156,axiom,
% 0.34/1.49      divide(X8,zero) != zero | divide(X8,X8) = X8).
% 0.34/1.49  
% 0.34/1.49  cnf(divide_and_equal,axiom,
% 0.34/1.49      divide(X0,X1) != zero | divide(X1,X0) != zero | X0 = X1).
% 0.34/1.49  
% 0.34/1.49  % # SZS output end Saturation.
% 0.34/1.49  % ------------------------------
% 0.34/1.49  % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.34/1.49  % Termination reason: Satisfiable
% 0.34/1.49  
% 0.34/1.49  % Active clauses: 28
% 0.34/1.49  % Passive clauses: 61
% 0.34/1.49  % Generated clauses: 597
% 0.34/1.49  % Final active clauses: 10
% 0.34/1.49  % Input clauses: 5
% 0.34/1.49  % Initial clauses: 5
% 0.34/1.49  % 
% 0.34/1.49  % Trivial inequalities: 58
% 0.34/1.49  % Fw demodulations: 179
% 0.34/1.49  % Bw demodulations: 50
% 0.34/1.49  % Condensations: 2
% 0.34/1.49  % Global subsumptions: 2
% 0.34/1.49  % 
% 0.34/1.49  % Simple tautologies: 6
% 0.34/1.49  % Forward subsumptions: 289
% 0.34/1.49  % 
% 0.34/1.49  % Forward superposition: 111
% 0.34/1.49  % Backward superposition: 174
% 0.34/1.49  % Self superposition: 15
% 0.34/1.49  % 
% 0.34/1.49  % Split clauses: 1
% 0.34/1.49  % Split components: 2
% 0.34/1.49  % SAT solver clauses: 67
% 0.34/1.49  % SAT solver unit clauses: 46
% 0.34/1.49  % SAT solver binary clauses: 18
% 0.34/1.49  % SAT solver learnt clauses: 2
% 0.34/1.49  % SAT solver learnt literals: 3
% 0.34/1.49  % 
% 0.34/1.49  % Sat splits: 1
% 0.34/1.49  % 
% 0.34/1.49  % TWLsolver clauses: 64
% 0.34/1.49  % TWLsolver calls for satisfiability: 151
% 0.34/1.49  % 
% 0.34/1.49  % Memory used [KB]: 895
% 0.34/1.49  % Time elapsed: 0.008 s
% 0.34/1.49  % ------------------------------
% 0.34/1.49  ----  Runtime statistics ----
% 0.34/1.49  clauses created: 605
% 0.34/1.49  clauses deleted: 402
% 0.34/1.49  ssat_new_components: 2
% 0.34/1.49  ssat_sat_clauses: 1
% 0.34/1.49  total_frozen: 34
% 0.34/1.49  -----------------------------
% 0.34/1.49  % ------------------------------
% 0.34/1.49  % Success in time 0.419 s
%------------------------------------------------------------------------------