TSTP Solution File: LCL239-10 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n025.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 : Tue Apr 30 13:41:20 EDT 2024

% Result   : Unsatisfiable 0.21s 0.46s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   43 (  43 unt;   0 def)
%            Number of atoms       :   43 (  42 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   2 con; 0-4 aty)
%            Number of variables   :   73 (  73   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3029,plain,
    $false,
    inference(trivial_inequality_removal,[],[f3009]) ).

fof(f3009,plain,
    true != true,
    inference(superposition,[],[f11,f2999]) ).

fof(f2999,plain,
    ! [X0] : true = theorem(not(and(X0,not(X0)))),
    inference(forward_demodulation,[],[f2977,f12]) ).

fof(f12,plain,
    ! [X6,X5] : and(X5,X6) = not(implies(X5,not(X6))),
    inference(forward_demodulation,[],[f10,f7]) ).

fof(f7,axiom,
    ! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

fof(f10,axiom,
    ! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).

fof(f2977,plain,
    ! [X0] : true = theorem(not(not(implies(X0,not(not(X0)))))),
    inference(superposition,[],[f2972,f7]) ).

fof(f2972,plain,
    ! [X0] : true = theorem(not(not(or(X0,not(X0))))),
    inference(superposition,[],[f2898,f1]) ).

fof(f1,axiom,
    ! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

fof(f2898,plain,
    ! [X0] : true = ifeq(true,true,theorem(not(not(or(X0,not(X0))))),true),
    inference(superposition,[],[f1787,f1768]) ).

fof(f1768,plain,
    ! [X0] : true = theorem(implies(X0,not(not(X0)))),
    inference(superposition,[],[f1764,f7]) ).

fof(f1764,plain,
    ! [X0] : true = theorem(or(X0,not(X0))),
    inference(superposition,[],[f1708,f1]) ).

fof(f1708,plain,
    ! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
    inference(superposition,[],[f1350,f193]) ).

fof(f193,plain,
    ! [X0,X1] : true = theorem(implies(implies(X0,X1),or(X1,not(X0)))),
    inference(superposition,[],[f191,f7]) ).

fof(f191,plain,
    ! [X0,X1] : true = theorem(implies(or(X0,X1),or(X1,X0))),
    inference(superposition,[],[f22,f1]) ).

fof(f22,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(implies(or(X0,X1),or(X1,X0))),true),
    inference(superposition,[],[f8,f4]) ).

fof(f4,axiom,
    ! [X0,X1] : true = axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f8,axiom,
    ! [X3] : true = ifeq(axiom(X3),true,theorem(X3),true),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f1350,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(implies(X0,X0),X1)),true,theorem(X1),true),
    inference(forward_demodulation,[],[f1340,f1]) ).

fof(f1340,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(implies(X0,X0),X1)),true,ifeq(true,true,theorem(X1),true),true),
    inference(superposition,[],[f9,f1321]) ).

fof(f1321,plain,
    ! [X0] : true = theorem(implies(X0,X0)),
    inference(superposition,[],[f1265,f1]) ).

fof(f1265,plain,
    ! [X0] : true = ifeq(true,true,theorem(implies(X0,X0)),true),
    inference(superposition,[],[f446,f1258]) ).

fof(f1258,plain,
    ! [X0,X1] : true = theorem(or(X0,implies(X1,X1))),
    inference(superposition,[],[f1214,f1]) ).

fof(f1214,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(or(X1,implies(X0,X0))),true),
    inference(superposition,[],[f425,f726]) ).

fof(f726,plain,
    ! [X2,X0,X1] : true = theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
    inference(forward_demodulation,[],[f710,f7]) ).

fof(f710,plain,
    ! [X2,X0,X1] : true = theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
    inference(superposition,[],[f619,f7]) ).

fof(f619,plain,
    ! [X2,X0,X1] : true = theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    inference(superposition,[],[f177,f1]) ).

fof(f177,plain,
    ! [X2,X0,X1] : true = ifeq(true,true,theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),true),
    inference(superposition,[],[f8,f5]) ).

fof(f5,axiom,
    ! [X2,X0,X1] : true = axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

fof(f425,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,theorem(X2),true),
    inference(forward_demodulation,[],[f403,f1]) ).

fof(f403,plain,
    ! [X2,X0,X1] : true = ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,ifeq(true,true,theorem(X2),true),true),
    inference(superposition,[],[f9,f54]) ).

fof(f54,plain,
    ! [X0,X1] : true = theorem(implies(X0,or(X1,X0))),
    inference(superposition,[],[f16,f1]) ).

fof(f16,plain,
    ! [X0,X1] : true = ifeq(true,true,theorem(implies(X0,or(X1,X0))),true),
    inference(superposition,[],[f8,f3]) ).

fof(f3,axiom,
    ! [X0,X1] : true = axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f446,plain,
    ! [X0] : true = ifeq(theorem(or(X0,X0)),true,theorem(X0),true),
    inference(superposition,[],[f394,f1]) ).

fof(f394,plain,
    ! [X0] : true = ifeq(true,true,ifeq(theorem(or(X0,X0)),true,theorem(X0),true),true),
    inference(superposition,[],[f9,f40]) ).

fof(f40,plain,
    ! [X0] : true = theorem(implies(or(X0,X0),X0)),
    inference(superposition,[],[f15,f1]) ).

fof(f15,plain,
    ! [X0] : true = ifeq(true,true,theorem(implies(or(X0,X0),X0)),true),
    inference(superposition,[],[f8,f2]) ).

fof(f2,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f9,axiom,
    ! [X3,X4] : true = ifeq(theorem(implies(X4,X3)),true,ifeq(theorem(X4),true,theorem(X3),true),true),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f1787,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(or(X0,not(X0)),X1)),true,theorem(X1),true),
    inference(forward_demodulation,[],[f1774,f1]) ).

fof(f1774,plain,
    ! [X0,X1] : true = ifeq(theorem(implies(or(X0,not(X0)),X1)),true,ifeq(true,true,theorem(X1),true),true),
    inference(superposition,[],[f9,f1764]) ).

fof(f11,axiom,
    true != theorem(not(and(p,not(p)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL239-10 : TPTP v8.1.2. Released v7.5.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Apr 29 23:18:56 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (3978)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (3981)WARNING: value z3 for option sas not known
% 0.14/0.37  % (3982)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37  % (3984)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.14/0.37  % (3979)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37  % (3980)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37  % (3983)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.14/0.37  % (3985)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.14/0.37  % (3981)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.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  TRYING [3]
% 0.14/0.39  TRYING [3]
% 0.14/0.39  TRYING [4]
% 0.21/0.44  TRYING [4]
% 0.21/0.46  % (3985)First to succeed.
% 0.21/0.46  % (3985)Refutation found. Thanks to Tanya!
% 0.21/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.47  % (3985)------------------------------
% 0.21/0.47  % (3985)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.47  % (3985)Termination reason: Refutation
% 0.21/0.47  
% 0.21/0.47  % (3985)Memory used [KB]: 2250
% 0.21/0.47  % (3985)Time elapsed: 0.090 s
% 0.21/0.47  % (3985)Instructions burned: 161 (million)
% 0.21/0.47  % (3985)------------------------------
% 0.21/0.47  % (3985)------------------------------
% 0.21/0.47  % (3978)Success in time 0.097 s
%------------------------------------------------------------------------------