TSTP Solution File: LCL265-10 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL265-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.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:30 EDT 2024
% Result : Unsatisfiable 17.87s 2.98s
% Output : Refutation 17.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 74 unt; 0 def)
% Number of atoms : 74 ( 73 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 : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-4 aty)
% Number of variables : 133 ( 133 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f92596,plain,
$false,
inference(trivial_inequality_removal,[],[f92548]) ).
fof(f92548,plain,
true != true,
inference(superposition,[],[f12,f92540]) ).
fof(f92540,plain,
! [X0] : true = theorem(equivalent(X0,not(not(X0)))),
inference(superposition,[],[f92524,f1]) ).
fof(f1,axiom,
! [X2,X0,X1] : ifeq(X0,X0,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
fof(f92524,plain,
! [X0] : true = ifeq(true,true,theorem(equivalent(X0,not(not(X0)))),true),
inference(forward_demodulation,[],[f92523,f1]) ).
fof(f92523,plain,
! [X0] : true = ifeq(true,true,ifeq(true,true,theorem(equivalent(X0,not(not(X0)))),true),true),
inference(forward_demodulation,[],[f92476,f58732]) ).
fof(f58732,plain,
! [X0] : true = theorem(implies(not(not(X0)),X0)),
inference(superposition,[],[f58216,f1]) ).
fof(f58216,plain,
! [X0] : true = ifeq(true,true,theorem(implies(not(not(X0)),X0)),true),
inference(forward_demodulation,[],[f58215,f7]) ).
fof(f7,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
fof(f58215,plain,
! [X0] : true = ifeq(true,true,theorem(or(not(not(not(X0))),X0)),true),
inference(forward_demodulation,[],[f57602,f1]) ).
fof(f57602,plain,
! [X0] : true = ifeq(true,true,ifeq(true,true,theorem(or(not(not(not(X0))),X0)),true),true),
inference(superposition,[],[f542,f56000]) ).
fof(f56000,plain,
! [X0] : true = theorem(or(X0,not(not(not(X0))))),
inference(superposition,[],[f55821,f1]) ).
fof(f55821,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(not(not(X0))))),true),
inference(superposition,[],[f2347,f55808]) ).
fof(f55808,plain,
! [X0,X1] : true = theorem(implies(or(X0,X1),or(X0,not(not(X1))))),
inference(superposition,[],[f6751,f1]) ).
fof(f6751,plain,
! [X0,X1] : true = ifeq(true,true,theorem(implies(or(X1,X0),or(X1,not(not(X0))))),true),
inference(superposition,[],[f2381,f3168]) ).
fof(f3168,plain,
! [X2,X0,X1] : true = theorem(or(and(X0,X1),implies(or(X2,X0),or(X2,not(X1))))),
inference(superposition,[],[f1804,f20]) ).
fof(f20,plain,
! [X2,X0,X1] : implies(implies(X0,not(X1)),X2) = or(and(X0,X1),X2),
inference(superposition,[],[f7,f13]) ).
fof(f13,plain,
! [X6,X5] : and(X5,X6) = not(implies(X5,not(X6))),
inference(forward_demodulation,[],[f10,f7]) ).
fof(f10,axiom,
! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
fof(f1804,plain,
! [X2,X0,X1] : true = theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(superposition,[],[f220,f1]) ).
fof(f220,plain,
! [X2,X0,X1] : true = ifeq(true,true,theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),true),
inference(superposition,[],[f8,f6]) ).
fof(f6,axiom,
! [X2,X0,X1] : true = axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f8,axiom,
! [X3] : true = ifeq(axiom(X3),true,theorem(X3),true),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
fof(f2381,plain,
! [X0,X1] : true = ifeq(theorem(or(and(X0,not(X0)),X1)),true,theorem(X1),true),
inference(forward_demodulation,[],[f2380,f20]) ).
fof(f2380,plain,
! [X0,X1] : true = ifeq(theorem(implies(implies(X0,not(not(X0))),X1)),true,theorem(X1),true),
inference(forward_demodulation,[],[f2363,f1]) ).
fof(f2363,plain,
! [X0,X1] : true = ifeq(theorem(implies(implies(X0,not(not(X0))),X1)),true,ifeq(true,true,theorem(X1),true),true),
inference(superposition,[],[f9,f2328]) ).
fof(f2328,plain,
! [X0] : true = theorem(implies(X0,not(not(X0)))),
inference(superposition,[],[f2323,f7]) ).
fof(f2323,plain,
! [X0] : true = theorem(or(X0,not(X0))),
inference(superposition,[],[f2224,f1]) ).
fof(f2224,plain,
! [X0] : true = ifeq(true,true,theorem(or(X0,not(X0))),true),
inference(superposition,[],[f1795,f227]) ).
fof(f227,plain,
! [X0,X1] : true = theorem(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[],[f225,f7]) ).
fof(f225,plain,
! [X0,X1] : true = theorem(implies(or(X0,X1),or(X1,X0))),
inference(superposition,[],[f23,f1]) ).
fof(f23,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/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f1795,plain,
! [X0,X1] : true = ifeq(theorem(implies(implies(X0,X0),X1)),true,theorem(X1),true),
inference(forward_demodulation,[],[f1785,f1]) ).
fof(f1785,plain,
! [X0,X1] : true = ifeq(theorem(implies(implies(X0,X0),X1)),true,ifeq(true,true,theorem(X1),true),true),
inference(superposition,[],[f9,f1766]) ).
fof(f1766,plain,
! [X0] : true = theorem(implies(X0,X0)),
inference(superposition,[],[f1708,f1]) ).
fof(f1708,plain,
! [X0] : true = ifeq(true,true,theorem(implies(X0,X0)),true),
inference(superposition,[],[f605,f1701]) ).
fof(f1701,plain,
! [X0,X1] : true = theorem(or(X0,implies(X1,X1))),
inference(superposition,[],[f1641,f1]) ).
fof(f1641,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(X1,implies(X0,X0))),true),
inference(superposition,[],[f578,f810]) ).
fof(f810,plain,
! [X2,X0,X1] : true = theorem(implies(implies(X0,or(X1,X2)),or(X1,implies(X0,X2)))),
inference(forward_demodulation,[],[f794,f7]) ).
fof(f794,plain,
! [X2,X0,X1] : true = theorem(implies(implies(X0,or(X1,X2)),or(X1,or(not(X0),X2)))),
inference(superposition,[],[f710,f7]) ).
fof(f710,plain,
! [X2,X0,X1] : true = theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(superposition,[],[f211,f1]) ).
fof(f211,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/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f578,plain,
! [X2,X0,X1] : true = ifeq(theorem(implies(implies(X0,or(X1,X0)),X2)),true,theorem(X2),true),
inference(forward_demodulation,[],[f550,f1]) ).
fof(f550,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,f59]) ).
fof(f59,plain,
! [X0,X1] : true = theorem(implies(X0,or(X1,X0))),
inference(superposition,[],[f17,f1]) ).
fof(f17,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/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f605,plain,
! [X0] : true = ifeq(theorem(or(X0,X0)),true,theorem(X0),true),
inference(superposition,[],[f541,f1]) ).
fof(f541,plain,
! [X0] : true = ifeq(true,true,ifeq(theorem(or(X0,X0)),true,theorem(X0),true),true),
inference(superposition,[],[f9,f42]) ).
fof(f42,plain,
! [X0] : true = theorem(implies(or(X0,X0),X0)),
inference(superposition,[],[f16,f1]) ).
fof(f16,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/sandbox/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/sandbox/benchmark/theBenchmark.p',rule_2) ).
fof(f2347,plain,
! [X0,X1] : true = ifeq(theorem(implies(or(X0,not(X0)),X1)),true,theorem(X1),true),
inference(forward_demodulation,[],[f2334,f1]) ).
fof(f2334,plain,
! [X0,X1] : true = ifeq(theorem(implies(or(X0,not(X0)),X1)),true,ifeq(true,true,theorem(X1),true),true),
inference(superposition,[],[f9,f2323]) ).
fof(f542,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(theorem(or(X0,X1)),true,theorem(or(X1,X0)),true),true),
inference(superposition,[],[f9,f225]) ).
fof(f92476,plain,
! [X0] : true = ifeq(true,true,ifeq(theorem(implies(not(not(X0)),X0)),true,theorem(equivalent(X0,not(not(X0)))),true),true),
inference(superposition,[],[f9,f92344]) ).
fof(f92344,plain,
! [X0] : true = theorem(implies(implies(not(not(X0)),X0),equivalent(X0,not(not(X0))))),
inference(superposition,[],[f92232,f11]) ).
fof(f11,axiom,
! [X6,X5] : equivalent(X5,X6) = and(implies(X5,X6),implies(X6,X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalent_defn) ).
fof(f92232,plain,
! [X0,X1] : true = theorem(implies(X1,and(implies(X0,not(not(X0))),X1))),
inference(superposition,[],[f92221,f7]) ).
fof(f92221,plain,
! [X0,X1] : true = theorem(implies(X0,and(or(X1,not(X1)),X0))),
inference(superposition,[],[f58249,f1]) ).
fof(f58249,plain,
! [X0,X1] : true = ifeq(true,true,theorem(implies(X1,and(or(X0,not(X0)),X1))),true),
inference(forward_demodulation,[],[f58248,f7]) ).
fof(f58248,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(not(X1),and(or(X0,not(X0)),X1))),true),
inference(forward_demodulation,[],[f57620,f1]) ).
fof(f57620,plain,
! [X0,X1] : true = ifeq(true,true,ifeq(true,true,theorem(or(not(X1),and(or(X0,not(X0)),X1))),true),true),
inference(superposition,[],[f542,f13323]) ).
fof(f13323,plain,
! [X0,X1] : true = theorem(or(and(or(X0,not(X0)),X1),not(X1))),
inference(superposition,[],[f13314,f20]) ).
fof(f13314,plain,
! [X0,X1] : true = theorem(implies(implies(or(X0,not(X0)),X1),X1)),
inference(superposition,[],[f4131,f1]) ).
fof(f4131,plain,
! [X0,X1] : true = ifeq(true,true,theorem(implies(implies(or(X0,not(X0)),X1),X1)),true),
inference(superposition,[],[f2347,f3985]) ).
fof(f3985,plain,
! [X0,X1] : true = theorem(implies(X0,implies(implies(X0,X1),X1))),
inference(forward_demodulation,[],[f3959,f7]) ).
fof(f3959,plain,
! [X0,X1] : true = theorem(or(not(X0),implies(implies(X0,X1),X1))),
inference(superposition,[],[f3955,f7]) ).
fof(f3955,plain,
! [X0,X1] : true = theorem(or(X0,implies(or(X0,X1),X1))),
inference(superposition,[],[f2225,f1]) ).
fof(f2225,plain,
! [X0,X1] : true = ifeq(true,true,theorem(or(X0,implies(or(X0,X1),X1))),true),
inference(superposition,[],[f1795,f810]) ).
fof(f12,axiom,
true != theorem(equivalent(p,not(not(p)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : LCL265-10 : TPTP v8.1.2. Released v7.3.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n010.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Apr 29 22:38:05 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (10073)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (10076)WARNING: value z3 for option sas not known
% 0.14/0.37 % (10076)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 % (10074)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (10075)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (10078)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.38 % (10079)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.38 % (10077)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (10080)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.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [4]
% 0.20/0.46 TRYING [4]
% 0.20/0.54 TRYING [5]
% 5.16/1.11 TRYING [5]
% 7.86/1.48 TRYING [1]
% 7.86/1.48 TRYING [2]
% 7.86/1.48 TRYING [3]
% 7.86/1.50 TRYING [4]
% 8.29/1.59 TRYING [5]
% 13.09/2.24 TRYING [6]
% 15.09/2.53 TRYING [6]
% 17.87/2.96 % (10080)First to succeed.
% 17.87/2.98 % (10080)Refutation found. Thanks to Tanya!
% 17.87/2.98 % SZS status Unsatisfiable for theBenchmark
% 17.87/2.98 % SZS output start Proof for theBenchmark
% See solution above
% 17.87/2.98 % (10080)------------------------------
% 17.87/2.98 % (10080)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 17.87/2.98 % (10080)Termination reason: Refutation
% 17.87/2.98
% 17.87/2.98 % (10080)Memory used [KB]: 44542
% 17.87/2.98 % (10080)Time elapsed: 2.591 s
% 17.87/2.98 % (10080)Instructions burned: 5717 (million)
% 17.87/2.98 % (10080)------------------------------
% 17.87/2.98 % (10080)------------------------------
% 17.87/2.98 % (10073)Success in time 2.591 s
%------------------------------------------------------------------------------