TSTP Solution File: LCL059-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL059-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 : n018.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:20 EDT 2024
% Result : Unsatisfiable 5.88s 1.17s
% Output : Refutation 5.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 12 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 63 ( 32 ~; 30 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 82 ( 82 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18862,plain,
$false,
inference(avatar_sat_refutation,[],[f1803,f18860]) ).
fof(f18860,plain,
~ spl0_13,
inference(avatar_contradiction_clause,[],[f18785]) ).
fof(f18785,plain,
( $false
| ~ spl0_13 ),
inference(resolution,[],[f16684,f5]) ).
fof(f5,axiom,
~ is_a_theorem(implies(implies(not(a),not(b)),implies(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_49) ).
fof(f16684,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))
| ~ spl0_13 ),
inference(resolution,[],[f16083,f49]) ).
fof(f49,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(not(X1),X2),X3)))
| is_a_theorem(implies(X0,implies(X1,X3))) ),
inference(resolution,[],[f21,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(f21,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X0,implies(X3,X2)))
| is_a_theorem(implies(X0,implies(X1,X2))) ),
inference(resolution,[],[f18,f8]) ).
fof(f8,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
| ~ is_a_theorem(implies(X2,X0)) ),
inference(resolution,[],[f2,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(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(f18,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f8,f1]) ).
fof(f16083,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X1,X0),X0)))
| ~ spl0_13 ),
inference(resolution,[],[f15976,f1677]) ).
fof(f1677,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,[],[f311,f1]) ).
fof(f311,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,[],[f46,f26]) ).
fof(f26,plain,
! [X0] : is_a_theorem(implies(X0,X0)),
inference(resolution,[],[f19,f4]) ).
fof(f19,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f18,f3]) ).
fof(f3,axiom,
! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).
fof(f46,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(implies(X0,implies(implies(implies(X1,X2),implies(X3,X2)),X4)))
| is_a_theorem(implies(X0,implies(implies(X3,X1),X4))) ),
inference(resolution,[],[f21,f2]) ).
fof(f15976,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X0,X1)))
| ~ spl0_13 ),
inference(resolution,[],[f1677,f8221]) ).
fof(f8221,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(implies(implies(not(X0),X0),X0),X1),X1))
| ~ spl0_13 ),
inference(resolution,[],[f5969,f439]) ).
fof(f439,plain,
( ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1)))
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f438]) ).
fof(f438,plain,
( spl0_13
<=> ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_13])]) ).
fof(f5969,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(implies(X2,X2),X0))
| is_a_theorem(implies(implies(X0,X1),X1)) ),
inference(resolution,[],[f781,f8]) ).
fof(f781,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(implies(X2,X2),X1)))
| is_a_theorem(implies(X0,X1)) ),
inference(resolution,[],[f41,f224]) ).
fof(f224,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X1))),
inference(resolution,[],[f187,f26]) ).
fof(f187,plain,
! [X0,X1] :
( ~ is_a_theorem(X0)
| is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f180,f19]) ).
fof(f180,plain,
! [X2,X0,X1] :
( is_a_theorem(implies(X0,implies(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f53,f4]) ).
fof(f53,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(implies(X0,implies(X1,X2)))
| is_a_theorem(implies(X0,implies(not(X3),X2)))
| ~ is_a_theorem(X3) ),
inference(resolution,[],[f21,f7]) ).
fof(f7,plain,
! [X0,X1] :
( is_a_theorem(implies(not(X0),X1))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f1,f4]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(implies(X2,X0))
| ~ is_a_theorem(implies(X2,implies(X1,X0))) ),
inference(resolution,[],[f24,f18]) ).
fof(f24,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),X1))
| ~ is_a_theorem(implies(not(X1),X0)) ),
inference(resolution,[],[f19,f8]) ).
fof(f1803,plain,
spl0_13,
inference(avatar_split_clause,[],[f1777,f438]) ).
fof(f1777,plain,
! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1))),
inference(resolution,[],[f435,f2]) ).
fof(f435,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(implies(implies(not(X1),X1),X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f213,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ is_a_theorem(implies(not(X0),X1))
| is_a_theorem(X0)
| ~ is_a_theorem(implies(X1,X0)) ),
inference(resolution,[],[f24,f1]) ).
fof(f213,plain,
! [X0,X1] : is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
inference(resolution,[],[f187,f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL059-1 : TPTP v8.1.2. Released v1.0.0.
% 0.05/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n018.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 22:55:13 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % (20036)Running in auto input_syntax mode. Trying TPTP
% 0.11/0.34 % (20041)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.11/0.34 % (20038)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.11/0.34 % (20037)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.11/0.34 % (20043)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 % (20039)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 % (20040)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 % (20042)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/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.35 TRYING [4]
% 0.11/0.35 TRYING [4]
% 0.11/0.35 TRYING [4]
% 0.11/0.35 TRYING [4]
% 0.11/0.38 TRYING [5]
% 0.11/0.38 TRYING [5]
% 0.11/0.38 TRYING [5]
% 0.11/0.38 TRYING [5]
% 1.56/0.61 TRYING [6]
% 2.20/0.64 TRYING [6]
% 2.20/0.64 TRYING [6]
% 2.20/0.65 TRYING [6]
% 5.88/1.16 % (20042)First to succeed.
% 5.88/1.17 % (20042)Refutation found. Thanks to Tanya!
% 5.88/1.17 % SZS status Unsatisfiable for theBenchmark
% 5.88/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 5.88/1.17 % (20042)------------------------------
% 5.88/1.17 % (20042)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 5.88/1.17 % (20042)Termination reason: Refutation
% 5.88/1.17
% 5.88/1.17 % (20042)Memory used [KB]: 6761
% 5.88/1.17 % (20042)Time elapsed: 0.822 s
% 5.88/1.17 % (20042)Instructions burned: 1575 (million)
% 5.88/1.17 % (20042)------------------------------
% 5.88/1.17 % (20042)------------------------------
% 5.88/1.17 % (20036)Success in time 0.825 s
%------------------------------------------------------------------------------