TSTP Solution File: LCL110-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL110-1 : TPTP v8.1.2. Released v1.0.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:40:31 EDT 2024
% Result : Unsatisfiable 0.11s 0.34s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 17 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f186,plain,
$false,
inference(avatar_sat_refutation,[],[f145,f161,f185]) ).
fof(f185,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f162]) ).
fof(f162,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f46,f61]) ).
fof(f61,plain,
! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
inference(resolution,[],[f19,f2]) ).
fof(f2,axiom,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_1) ).
fof(f19,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X2),not(X1))))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f14,f5]) ).
fof(f5,axiom,
! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_5) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f11,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(f11,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f3,f1]) ).
fof(f3,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',mv_2) ).
fof(f46,plain,
( ! [X1] : ~ is_a_theorem(X1)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f45]) ).
fof(f45,plain,
( spl0_1
<=> ! [X1] : ~ is_a_theorem(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f161,plain,
~ spl0_6,
inference(avatar_contradiction_clause,[],[f151]) ).
fof(f151,plain,
( $false
| ~ spl0_6 ),
inference(resolution,[],[f144,f6]) ).
fof(f6,axiom,
~ is_a_theorem(implies(not(not(a)),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_mv_24) ).
fof(f144,plain,
( ! [X0] : is_a_theorem(implies(not(not(X0)),X0))
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f143]) ).
fof(f143,plain,
( spl0_6
<=> ! [X0] : is_a_theorem(implies(not(not(X0)),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f145,plain,
( spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f135,f143,f45]) ).
fof(f135,plain,
! [X0,X1] :
( is_a_theorem(implies(not(not(X0)),X0))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f70,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X2,X1)))
| is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f14,f15]) ).
fof(f15,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f12,f7]) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f1,f2]) ).
fof(f12,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(X1,X0),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f4,f1]) ).
fof(f4,axiom,
! [X0,X1] : is_a_theorem(implies(implies(implies(X0,X1),X1),implies(implies(X1,X0),X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv_3) ).
fof(f70,plain,
! [X0,X1] : is_a_theorem(implies(not(not(X0)),implies(X1,X0))),
inference(resolution,[],[f61,f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL110-1 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Apr 29 22:37:50 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.32 % (8863)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.33 % (8865)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.33 % (8864)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.33 % (8868)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.33 % (8869)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.11/0.33 % (8870)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.33 % (8867)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.33 % (8866)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.33 TRYING [1]
% 0.11/0.33 TRYING [1]
% 0.11/0.33 TRYING [1]
% 0.11/0.33 TRYING [2]
% 0.11/0.33 TRYING [2]
% 0.11/0.33 TRYING [1]
% 0.11/0.33 TRYING [2]
% 0.11/0.33 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 % (8869)First to succeed.
% 0.11/0.34 % (8869)Refutation found. Thanks to Tanya!
% 0.11/0.34 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.34 % (8869)------------------------------
% 0.11/0.34 % (8869)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.11/0.34 % (8869)Termination reason: Refutation
% 0.11/0.34
% 0.11/0.34 % (8869)Memory used [KB]: 789
% 0.11/0.34 % (8869)Time elapsed: 0.007 s
% 0.11/0.34 % (8869)Instructions burned: 12 (million)
% 0.11/0.34 % (8869)------------------------------
% 0.11/0.34 % (8869)------------------------------
% 0.11/0.34 % (8863)Success in time 0.021 s
%------------------------------------------------------------------------------