TMTP Model File: NUM287-1.003-Sat

View Problem - Process Model

%------------------------------------------------------------------------------
% File       : Vampire---4.0
% Problem    : NUM287-1 : TPTP v6.2.0. Bugfixed v4.0.0.
% Transform  : none
% Format     : tptp:raw
% Command    : vampire --mode casc -t %d %s

% Computer   : n190.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   : Thu Jul  9 22:13:09 EDT 2015

% Result     : Satisfiable 12.49s
% Output     : Saturation 12.49s
% Verified   : 
% Statistics : Number of clauses        :    9 (   9 expanded)
%              Number of leaves         :    9 (   9 expanded)
%              Depth                    :    0
%              Number of atoms          :   15 (  15 expanded)
%              Number of equality atoms :    0 (   0 expanded)
%              Maximal clause size      :    3 (   2 average)
%              Maximal term depth       :    4 (   2 average)

% Comments   : 
%------------------------------------------------------------------------------
%----WARNING: Vampire---4.0 format not known, defaulting to TPTP
cnf(transitivity_of_less,axiom,
    ( less(X2,X1)
    | ~ less(X2,X0)
    | ~ less(X0,X1) )).

cnf(smaller_number,axiom,
    ( less(X1,X2)
    | ~ equalish(add(successor(X0),X1),X2) )).

cnf(successor_substitution,axiom,
    ( equalish(successor(X0),successor(X1))
    | ~ equalish(X0,X1) )).

cnf(times,axiom,
    ( equalish(multiply(X0,successor(X1)),add(multiply(X0,X1),X0)) )).

cnf(times_zero,axiom,
    ( equalish(multiply(X0,n0),n0) )).

cnf(less_lemma,axiom,
    ( equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1)
    | ~ less(X0,X1) )).

cnf(addition,axiom,
    ( equalish(add(X0,successor(X1)),successor(add(X0,X1))) )).

cnf(adding_zero,axiom,
    ( equalish(add(X0,n0),X0) )).

cnf(successor_equality1,axiom,
    ( ~ equalish(successor(X0),successor(X1))
    | equalish(X0,X1) )).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : NUM287-1 : TPTP v6.2.0. Bugfixed v4.0.0.
% 0.00/0.03  % Command    : vampire --mode casc -t %d %s
% 0.02/1.07  % Computer   : n190.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:25:17 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: 14
% 0.02/1.08  lrs+11_10_bs=unit_only:br=off:gs=on:gsssp=full:nwc=1:stl=30:sos=all:sac=on:sdd=large:ssfp=100000:ssfq=1.2:smm=off:ssnc=none:sp=occurrence:urr=on_13 on theBenchmark
% 0.02/1.08  % Refutation not found, incomplete strategy
% 0.02/1.08  % ------------------------------
% 0.02/1.08  % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.02/1.08  % Termination reason: Refutation not found, incomplete strategy
% 0.02/1.08  
% 0.02/1.08  % Active clauses: 9
% 0.02/1.08  % Final active clauses: 9
% 0.02/1.08  % Input clauses: 9
% 0.02/1.08  % Initial clauses: 9
% 0.02/1.08  % 
% 0.02/1.08  % Memory used [KB]: 511
% 0.02/1.08  % Time elapsed: 0.001 s
% 0.02/1.08  % ------------------------------
% 0.02/1.08  ----  Runtime statistics ----
% 0.02/1.08  clauses created: 9
% 0.02/1.08  -----------------------------
% 0.02/1.08  % ------------------------------
% 0.02/1.08  % remaining time: 2999 next slice time: 3
% 0.02/1.08  dis+1002_5_gs=on:gsem=off:gsssp=full:lwlo=on:nwc=1:sas=minisat:sos=on:sac=on:sdd=large:sfr=on:ssfp=100000:ssfq=1.0:ssnc=none:sp=reverse_arity_1 on theBenchmark
% 0.02/1.09  % Refutation not found, incomplete strategy
% 0.02/1.09  % ------------------------------
% 0.02/1.09  % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 0.02/1.09  % Termination reason: Refutation not found, incomplete strategy
% 0.02/1.09  
% 0.02/1.09  % Active clauses: 9
% 0.02/1.09  % Final active clauses: 9
% 0.02/1.09  % Input clauses: 9
% 0.02/1.09  % Initial clauses: 9
% 0.02/1.09  % 
% 0.02/1.09  % SAT solver clauses: 2
% 0.02/1.09  % 
% 0.02/1.09  % Memory used [KB]: 511
% 0.02/1.09  % Time elapsed: 0.001 s
% 0.02/1.09  % ------------------------------
% 0.02/1.09  ----  Runtime statistics ----
% 0.02/1.09  clauses created: 9
% 0.02/1.09  -----------------------------
% 0.02/1.09  % ------------------------------
% 0.02/1.09  % remaining time: 2999 next slice time: 123
% 0.02/1.09  dis+1_40_bs=unit_only:fsr=off:nwc=1:sas=minisat:sdd=large:ssfp=1000:ssfq=1.1:smm=sco:ssnc=none:sp=reverse_arity:updr=off_117 on theBenchmark
% 12.39/13.49  % (44760)Time limit reached!
% 12.39/13.49  % ------------------------------
% 12.39/13.49  % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 12.39/13.49  % Termination reason: Time limit
% 12.39/13.49  % Termination phase: Saturation
% 12.39/13.49  
% 12.39/13.49  % Active clauses: 13766
% 12.39/13.49  % Passive clauses: 46599
% 12.39/13.49  % Generated clauses: 60469
% 12.39/13.49  % Final active clauses: 13766
% 12.39/13.49  % Final passive clauses: 16838
% 12.39/13.49  % Input clauses: 9
% 12.39/13.49  % Initial clauses: 9
% 12.39/13.49  % 
% 12.39/13.49  % Forward subsumptions: 29864
% 12.39/13.49  % 
% 12.39/13.49  % Binary resolution: 60460
% 12.39/13.49  % 
% 12.39/13.49  % SAT solver clauses: 1
% 12.39/13.49  % 
% 12.39/13.49  % Memory used [KB]: 467199
% 12.39/13.49  % Time elapsed: 12.400 s
% 12.39/13.49  % ------------------------------
% 12.39/13.49  ----  Runtime statistics ----
% 12.39/13.49  clauses created: 60469
% 12.39/13.49  clauses deleted: 13870
% 12.39/13.49  -----------------------------
% 12.39/13.49  % ------------------------------
% 12.49/13.50  % remaining time: 2875 next slice time: 4
% 12.49/13.50  dis-11_5_cond=fast:fsr=off:gs=on:gsem=off:nwc=1:spl=off:sp=occurrence:updr=off_2 on theBenchmark
% 12.49/13.51  Satisfiable!
% 12.49/13.51  % SZS status Satisfiable for theBenchmark
% 12.49/13.51  % # SZS output start Saturation.
% 12.49/13.51  cnf(transitivity_of_less,axiom,
% 12.49/13.51      less(X2,X1) | ~less(X2,X0) | ~less(X0,X1)).
% 12.49/13.51  
% 12.49/13.51  cnf(smaller_number,axiom,
% 12.49/13.51      less(X1,X2) | ~equalish(add(successor(X0),X1),X2)).
% 12.49/13.51  
% 12.49/13.51  cnf(successor_substitution,axiom,
% 12.49/13.51      equalish(successor(X0),successor(X1)) | ~equalish(X0,X1)).
% 12.49/13.51  
% 12.49/13.51  cnf(times,axiom,
% 12.49/13.51      equalish(multiply(X0,successor(X1)),add(multiply(X0,X1),X0))).
% 12.49/13.51  
% 12.49/13.51  cnf(times_zero,axiom,
% 12.49/13.51      equalish(multiply(X0,n0),n0)).
% 12.49/13.51  
% 12.49/13.51  cnf(less_lemma,axiom,
% 12.49/13.51      equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X0)),X0),X1) | ~less(X0,X1)).
% 12.49/13.51  
% 12.49/13.51  cnf(addition,axiom,
% 12.49/13.51      equalish(add(X0,successor(X1)),successor(add(X0,X1)))).
% 12.49/13.51  
% 12.49/13.51  cnf(adding_zero,axiom,
% 12.49/13.51      equalish(add(X0,n0),X0)).
% 12.49/13.51  
% 12.49/13.51  cnf(successor_equality1,axiom,
% 12.49/13.51      ~equalish(successor(X0),successor(X1)) | equalish(X0,X1)).
% 12.49/13.51  
% 12.49/13.51  % # SZS output end Saturation.
% 12.49/13.51  % ------------------------------
% 12.49/13.51  % Version: Vampire 4.0 (commit 2df2fce on 2015-07-07 02:33:56 +0100)
% 12.49/13.51  % Termination reason: Satisfiable
% 12.49/13.51  
% 12.49/13.51  % Active clauses: 9
% 12.49/13.51  % Passive clauses: 9
% 12.49/13.51  % Generated clauses: 10
% 12.49/13.51  % Final active clauses: 9
% 12.49/13.51  % Input clauses: 9
% 12.49/13.51  % Initial clauses: 9
% 12.49/13.51  % 
% 12.49/13.51  % Simple tautologies: 1
% 12.49/13.51  % 
% 12.49/13.51  % Binary resolution: 1
% 12.49/13.51  % 
% 12.49/13.51  % SAT solver clauses: 18
% 12.49/13.51  % SAT solver unit clauses: 8
% 12.49/13.51  % SAT solver binary clauses: 8
% 12.49/13.51  % 
% 12.49/13.51  % TWLsolver clauses: 18
% 12.49/13.51  % TWLsolver calls for satisfiability: 74
% 12.49/13.51  % 
% 12.49/13.51  % Memory used [KB]: 639
% 12.49/13.51  % Time elapsed: 0.001 s
% 12.49/13.51  % ------------------------------
% 12.49/13.51  ----  Runtime statistics ----
% 12.49/13.51  clauses created: 10
% 12.49/13.51  clauses deleted: 1
% 12.49/13.51  -----------------------------
% 12.49/13.51  % ------------------------------
% 12.49/13.51  % Success in time 12.43 s
%------------------------------------------------------------------------------