TSTP Solution File: LCL172-3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL172-3 : 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 : n011.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:43 EDT 2024
% Result : Unsatisfiable 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 22
% Syntax : Number of formulae : 59 ( 22 unt; 0 def)
% Number of atoms : 117 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 105 ( 47 ~; 45 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 17 ( 15 usr; 14 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 79 ( 79 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f81,plain,
$false,
inference(avatar_sat_refutation,[],[f20,f25,f29,f33,f39,f43,f48,f52,f57,f62,f68,f73,f77,f80]) ).
fof(f80,plain,
( spl0_2
| ~ spl0_12 ),
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f78,plain,
( $false
| spl0_2
| ~ spl0_12 ),
inference(resolution,[],[f72,f24]) ).
fof(f24,plain,
( ~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r))))
| spl0_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f22,plain,
( spl0_2
<=> theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
fof(f72,plain,
( ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2))))
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f71,plain,
( spl0_12
<=> ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_12])]) ).
fof(f77,plain,
( spl0_13
| ~ spl0_6
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f63,f46,f41,f75]) ).
fof(f75,plain,
( spl0_13
<=> ! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_13])]) ).
fof(f41,plain,
( spl0_6
<=> ! [X4,X3] :
( ~ theorem(X4)
| theorem(X3)
| ~ theorem(or(not(X4),X3)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
fof(f46,plain,
( spl0_7
<=> ! [X0,X1] : theorem(or(not(X0),or(X1,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
fof(f63,plain,
( ! [X0,X1] :
( theorem(or(X0,X1))
| ~ theorem(X1) )
| ~ spl0_6
| ~ spl0_7 ),
inference(resolution,[],[f47,f42]) ).
fof(f42,plain,
( ! [X3,X4] :
( ~ theorem(or(not(X4),X3))
| theorem(X3)
| ~ theorem(X4) )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f41]) ).
fof(f47,plain,
( ! [X0,X1] : theorem(or(not(X0),or(X1,X0)))
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f46]) ).
fof(f73,plain,
( spl0_12
| ~ spl0_1
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f53,f50,f18,f71]) ).
fof(f18,plain,
( spl0_1
<=> ! [X3] :
( ~ axiom(X3)
| theorem(X3) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f50,plain,
( spl0_8
<=> ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
fof(f53,plain,
( ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2))))
| ~ spl0_1
| ~ spl0_8 ),
inference(resolution,[],[f51,f19]) ).
fof(f19,plain,
( ! [X3] :
( ~ axiom(X3)
| theorem(X3) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f51,plain,
( ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2))))
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f68,plain,
( spl0_11
| ~ spl0_1
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f44,f37,f18,f66]) ).
fof(f66,plain,
( spl0_11
<=> ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_11])]) ).
fof(f37,plain,
( spl0_5
<=> ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f44,plain,
( ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0)))
| ~ spl0_1
| ~ spl0_5 ),
inference(resolution,[],[f38,f19]) ).
fof(f38,plain,
( ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0)))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f62,plain,
( spl0_10
| ~ spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f35,f31,f18,f60]) ).
fof(f60,plain,
( spl0_10
<=> ! [X0] : theorem(or(not(or(X0,X0)),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
fof(f31,plain,
( spl0_4
<=> ! [X0] : axiom(or(not(or(X0,X0)),X0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f35,plain,
( ! [X0] : theorem(or(not(or(X0,X0)),X0))
| ~ spl0_1
| ~ spl0_4 ),
inference(resolution,[],[f32,f19]) ).
fof(f32,plain,
( ! [X0] : axiom(or(not(or(X0,X0)),X0))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f57,plain,
spl0_9,
inference(avatar_split_clause,[],[f14,f55]) ).
fof(f55,plain,
( spl0_9
<=> ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
fof(f14,plain,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(definition_unfolding,[],[f5,f6,f6,f6]) ).
fof(f6,axiom,
! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
fof(f52,plain,
spl0_8,
inference(avatar_split_clause,[],[f15,f50]) ).
fof(f15,plain,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(definition_unfolding,[],[f4,f6]) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
fof(f48,plain,
( spl0_7
| ~ spl0_1
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f34,f27,f18,f46]) ).
fof(f27,plain,
( spl0_3
<=> ! [X0,X1] : axiom(or(not(X0),or(X1,X0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f34,plain,
( ! [X0,X1] : theorem(or(not(X0),or(X1,X0)))
| ~ spl0_1
| ~ spl0_3 ),
inference(resolution,[],[f28,f19]) ).
fof(f28,plain,
( ! [X0,X1] : axiom(or(not(X0),or(X1,X0)))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f43,plain,
spl0_6,
inference(avatar_split_clause,[],[f16,f41]) ).
fof(f16,plain,
! [X3,X4] :
( ~ theorem(X4)
| theorem(X3)
| ~ theorem(or(not(X4),X3)) ),
inference(definition_unfolding,[],[f8,f6]) ).
fof(f8,axiom,
! [X3,X4] :
( ~ theorem(X4)
| theorem(X3)
| ~ theorem(implies(X4,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
fof(f39,plain,
spl0_5,
inference(avatar_split_clause,[],[f13,f37]) ).
fof(f13,plain,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(definition_unfolding,[],[f3,f6]) ).
fof(f3,axiom,
! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
fof(f33,plain,
spl0_4,
inference(avatar_split_clause,[],[f12,f31]) ).
fof(f12,plain,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
inference(definition_unfolding,[],[f1,f6]) ).
fof(f1,axiom,
! [X0] : axiom(implies(or(X0,X0),X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).
fof(f29,plain,
spl0_3,
inference(avatar_split_clause,[],[f11,f27]) ).
fof(f11,plain,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
inference(definition_unfolding,[],[f2,f6]) ).
fof(f2,axiom,
! [X0,X1] : axiom(implies(X0,or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
fof(f25,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f10,f22]) ).
fof(f10,plain,
~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6]) ).
fof(f9,axiom,
~ theorem(implies(implies(p,implies(q,r)),implies(q,implies(p,r)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f20,plain,
spl0_1,
inference(avatar_split_clause,[],[f7,f18]) ).
fof(f7,axiom,
! [X3] :
( ~ axiom(X3)
| theorem(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL172-3 : TPTP v8.1.2. Released v2.3.0.
% 0.12/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Apr 29 23:02:46 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (29544)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (29547)WARNING: value z3 for option sas not known
% 0.15/0.38 % (29546)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (29548)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (29545)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (29547)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.15/0.38 % (29549)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.15/0.38 % (29551)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.15/0.38 % (29550)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.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [1]
% 0.15/0.38 % (29549)First to succeed.
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 % (29549)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (29549)------------------------------
% 0.15/0.39 % (29549)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (29549)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (29549)Memory used [KB]: 791
% 0.15/0.39 % (29549)Time elapsed: 0.004 s
% 0.15/0.39 % (29549)Instructions burned: 4 (million)
% 0.15/0.39 % (29549)------------------------------
% 0.15/0.39 % (29549)------------------------------
% 0.15/0.39 % (29544)Success in time 0.02 s
%------------------------------------------------------------------------------