TSTP Solution File: LCL367-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL367-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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:50 EDT 2024
% Result : Unsatisfiable 0.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 28 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 103 ( 103 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4454,plain,
$false,
inference(resolution,[],[f4399,f5]) ).
fof(f5,axiom,
~ is_a_theorem(implies(x,implies(implies(y,x),x))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_17) ).
fof(f4399,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
inference(resolution,[],[f4359,f1321]) ).
fof(f1321,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(not(not(X0)),X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f1311,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f1311,plain,
! [X0,X1] : is_a_theorem(implies(implies(implies(not(not(X0)),X1),X0),X0)),
inference(resolution,[],[f1281,f6]) ).
fof(f6,plain,
! [X0] :
( ~ is_a_theorem(implies(not(X0),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f1,f3]) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
fof(f1281,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(implies(implies(not(not(X1)),X2),X1),X1))),
inference(resolution,[],[f26,f654]) ).
fof(f654,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(not(X2),X2),X2),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f397,f1]) ).
fof(f397,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(implies(not(X0),X0),X0),X1),implies(X2,X1))),
inference(resolution,[],[f355,f16]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X2,X0))
| is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
inference(resolution,[],[f2,f1]) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).
fof(f355,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[],[f345,f18]) ).
fof(f18,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1))),
inference(resolution,[],[f16,f3]) ).
fof(f345,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X2),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f309,f1]) ).
fof(f309,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(X0,X0),X1),implies(X2,X1))),
inference(resolution,[],[f295,f16]) ).
fof(f295,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[],[f289,f3]) ).
fof(f289,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(not(implies(X2,X2)),X3),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f139,f1]) ).
fof(f139,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(not(implies(X0,X0)),X1),X2),implies(X3,X2))),
inference(resolution,[],[f130,f16]) ).
fof(f130,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(not(implies(X1,X1)),X2))),
inference(resolution,[],[f55,f27]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(not(X0),X2),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f20,f1]) ).
fof(f20,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
inference(resolution,[],[f16,f4]) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).
fof(f55,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(not(implies(X2,X2)),X1))),
inference(resolution,[],[f51,f16]) ).
fof(f51,plain,
! [X0,X1] : is_a_theorem(implies(not(implies(X0,X0)),X1)),
inference(resolution,[],[f42,f7]) ).
fof(f7,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[],[f1,f4]) ).
fof(f42,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f27,f3]) ).
fof(f26,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X2),implies(implies(implies(not(X0),X3),X1),X2))),
inference(resolution,[],[f20,f16]) ).
fof(f4359,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X1)))),
inference(resolution,[],[f3998,f654]) ).
fof(f3998,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(X1,X2)),X3),implies(X2,X3))),
inference(resolution,[],[f3916,f16]) ).
fof(f3916,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(X2,X0)))),
inference(resolution,[],[f3381,f2074]) ).
fof(f2074,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X2,implies(X0,X1)))),
inference(resolution,[],[f202,f397]) ).
fof(f202,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(implies(X1,X3),implies(X0,X3)),X2))
| is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[],[f19,f1]) ).
fof(f19,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X2,X0),X3))),
inference(resolution,[],[f16,f2]) ).
fof(f3381,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,implies(not(X0),X3)),X1))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f2154,f1]) ).
fof(f2154,plain,
! [X2,X3,X0,X1] : is_a_theorem(implies(implies(implies(X0,implies(not(X1),X2)),X3),implies(X1,X3))),
inference(resolution,[],[f2127,f16]) ).
fof(f2127,plain,
! [X2,X0,X1] : is_a_theorem(implies(X0,implies(X1,implies(not(X0),X2)))),
inference(resolution,[],[f2073,f27]) ).
fof(f2073,plain,
! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X1)))),
inference(resolution,[],[f202,f309]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : LCL367-1 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n019.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 : Mon Apr 29 23:06:59 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % (27421)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34 % (27427)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.34 % (27422)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34 % (27426)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.34 % (27425)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.11/0.34 % (27424)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.11/0.34 % (27423)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34 % (27428)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [1]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [2]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [3]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 TRYING [4]
% 0.11/0.34 TRYING [4]
% 0.11/0.36 TRYING [5]
% 0.11/0.36 TRYING [5]
% 0.11/0.36 TRYING [5]
% 0.11/0.37 TRYING [5]
% 0.16/0.41 % (27426)First to succeed.
% 0.16/0.41 % (27426)Refutation found. Thanks to Tanya!
% 0.16/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.41 % (27426)------------------------------
% 0.16/0.41 % (27426)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.41 % (27426)Termination reason: Refutation
% 0.16/0.41
% 0.16/0.41 % (27426)Memory used [KB]: 1858
% 0.16/0.41 % (27426)Time elapsed: 0.072 s
% 0.16/0.41 % (27426)Instructions burned: 152 (million)
% 0.16/0.41 % (27426)------------------------------
% 0.16/0.41 % (27426)------------------------------
% 0.16/0.41 % (27421)Success in time 0.087 s
%------------------------------------------------------------------------------