TSTP Solution File: LCL911+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL911+1 : TPTP v8.1.2. Released v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n022.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 07:55:45 EDT 2024

% Result   : Satisfiable 0.11s 0.35s
% Output   : Saturation 0.11s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u284,axiom,
    is_a_theorem(X0) ).

cnf(u190,axiom,
    possibly(X0) = not(necessarily(not(X0))) ).

cnf(u209,axiom,
    ( ~ is_a_theorem(equiv(X0,X1))
    | X0 = X1 ) ).

cnf(u216,axiom,
    ( is_a_theorem(implies(X0,X1))
    | ~ is_a_theorem(X1) ) ).

cnf(u165,axiom,
    op_possibly ).

cnf(u146,axiom,
    axiom_K ).

cnf(u199,axiom,
    is_a_theorem(implies(X0,implies(X1,X0))) ).

cnf(u161,axiom,
    modus_ponens ).

cnf(u221,axiom,
    ( ~ is_a_theorem(and(X0,X1))
    | is_a_theorem(X0) ) ).

cnf(u202,axiom,
    is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ).

cnf(u195,axiom,
    is_a_theorem(implies(possibly(X0),necessarily(possibly(X0)))) ).

cnf(u158,axiom,
    implies_2 ).

cnf(u151,axiom,
    equivalence_1 ).

cnf(u242,axiom,
    or(X0,X1) = implies(not(X0),X1) ).

cnf(u191,axiom,
    implies(X0,X1) = not(and(X0,not(X1))) ).

cnf(u263,axiom,
    is_a_theorem(or(X0,or(X1,not(X0)))) ).

cnf(u217,axiom,
    ( is_a_theorem(implies(X0,and(X1,X0)))
    | ~ is_a_theorem(X1) ) ).

cnf(u214,axiom,
    ( is_a_theorem(or(X0,X1))
    | ~ is_a_theorem(X0) ) ).

cnf(u154,axiom,
    or_1 ).

cnf(u147,axiom,
    necessitation ).

cnf(u196,axiom,
    ( is_a_theorem(necessarily(X0))
    | ~ is_a_theorem(X0) ) ).

cnf(u254,axiom,
    ( ~ is_a_theorem(or(X0,X1))
    | is_a_theorem(X1)
    | ~ is_a_theorem(not(X0)) ) ).

cnf(u229,axiom,
    ( is_a_theorem(and(X0,X1))
    | ~ is_a_theorem(X0)
    | ~ is_a_theorem(X1) ) ).

cnf(u210,axiom,
    ( ~ is_a_theorem(implies(X0,X1))
    | is_a_theorem(X1)
    | ~ is_a_theorem(X0) ) ).

cnf(u203,axiom,
    is_a_theorem(implies(equiv(X0,X1),implies(X1,X0))) ).

cnf(u166,axiom,
    op_or ).

cnf(u159,axiom,
    implies_1 ).

cnf(u148,axiom,
    substitution_of_equivalents ).

cnf(u192,axiom,
    or(X0,X1) = not(and(not(X0),not(X1))) ).

cnf(u162,axiom,
    and_2 ).

cnf(u144,axiom,
    axiom_5 ).

cnf(u215,axiom,
    ( is_a_theorem(or(X0,X1))
    | ~ is_a_theorem(X1) ) ).

cnf(u222,axiom,
    ( ~ is_a_theorem(necessarily(X0))
    | is_a_theorem(X0) ) ).

cnf(u155,axiom,
    and_3 ).

cnf(u204,axiom,
    is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))) ).

cnf(u197,axiom,
    is_a_theorem(implies(X0,or(X0,X1))) ).

cnf(u218,axiom,
    ( ~ is_a_theorem(equiv(X1,X0))
    | is_a_theorem(implies(X0,X1)) ) ).

cnf(u200,axiom,
    is_a_theorem(implies(and(X0,X1),X1)) ).

cnf(u156,axiom,
    and_1 ).

cnf(u149,axiom,
    equivalence_3 ).

cnf(u289,axiom,
    X0 = X1 ).

cnf(u163,axiom,
    op_equiv ).

cnf(u152,axiom,
    or_3 ).

cnf(u145,axiom,
    axiom_M ).

cnf(u262,axiom,
    is_a_theorem(or(X0,or(not(X0),X1))) ).

cnf(u219,axiom,
    ( ~ is_a_theorem(equiv(X0,X1))
    | is_a_theorem(implies(X0,X1)) ) ).

cnf(u164,axiom,
    op_implies_and ).

cnf(u258,axiom,
    is_a_theorem(or(X0,implies(X1,not(X0)))) ).

cnf(u201,axiom,
    is_a_theorem(implies(and(X0,X1),X0)) ).

cnf(u157,axiom,
    implies_3 ).

cnf(u198,axiom,
    is_a_theorem(implies(X1,or(X0,X1))) ).

cnf(u213,axiom,
    possibly(necessarily(not(X0))) = not(necessarily(possibly(X0))) ).

cnf(u220,axiom,
    ( ~ is_a_theorem(and(X1,X0))
    | is_a_theorem(X0) ) ).

cnf(u194,axiom,
    is_a_theorem(implies(necessarily(X0),X0)) ).

cnf(u160,axiom,
    modus_tollens ).

cnf(u153,axiom,
    or_2 ).

cnf(u150,axiom,
    equivalence_2 ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem    : LCL911+1 : TPTP v8.1.2. Released v6.4.0.
% 0.05/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32  % Computer : n022.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri May  3 13:32:12 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.11/0.33  % (19272)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34  % (19275)WARNING: value z3 for option sas not known
% 0.11/0.34  % (19276)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.11/0.34  % (19277)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.11/0.34  % (19279)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.11/0.34  % (19274)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.11/0.34  % (19273)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.11/0.34  % (19275)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34  % (19278)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.11/0.35  TRYING [1]
% 0.11/0.35  Finite Model Found!
% 0.11/0.35  % SZS status Satisfiable for theBenchmark
% 0.11/0.35  19276 Aborted by signal SIGSEGV on /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35  % (19276)------------------------------
% 0.11/0.35  % (19276)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.35  % (19276)Termination reason: Unknown
% 0.11/0.35  % (19276)Termination phase: Finite model building constraint generation
% 0.11/0.35  
% 0.11/0.35  % (19276)Memory used [KB]: 994
% 0.11/0.35  % (19276)Time elapsed: 0.004 s
% 0.11/0.35  % (19276)Instructions burned: 7 (million)
% 0.11/0.35  % (19276)------------------------------
% 0.11/0.35  % (19276)------------------------------
% 0.11/0.35  Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.35  ???
% 0.11/0.35   ???
% 0.11/0.35    ???
% 0.11/0.35     ???
% 0.11/0.35      ???
% 0.11/0.35       ???
% 0.11/0.35        ???
% 0.11/0.35         ???
% 0.11/0.35          ???
% 0.11/0.35           ???
% 0.11/0.35            ???
% 0.11/0.35             ???
% 0.11/0.35              ???
% 0.11/0.35               ???
% 0.11/0.35                ???
% 0.11/0.35                 ???
% 0.11/0.35                  ???
% 0.11/0.35                   ???
% 0.11/0.35  % (19275)First to succeed.
% 0.11/0.35  % (19275)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19272"
% 0.11/0.35  % SZS status Satisfiable for theBenchmark
% 0.11/0.35  % (19275)# SZS output start Saturation.
% See solution above
% 0.11/0.35  % (19275)------------------------------
% 0.11/0.35  % (19275)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.11/0.35  % (19275)Termination reason: Satisfiable
% 0.11/0.35  
% 0.11/0.35  % (19275)Memory used [KB]: 1090
% 0.11/0.35  % (19275)Time elapsed: 0.008 s
% 0.11/0.35  % (19275)Instructions burned: 11 (million)
% 0.11/0.35  % (19272)Success in time 0.024 s
%------------------------------------------------------------------------------