TSTP Solution File: SWW101+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n009.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 : Wed Aug 31 19:18:31 EDT 2022
% Result : Theorem 1.79s 0.59s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 99 ( 34 unt; 0 def)
% Number of atoms : 215 ( 103 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 202 ( 86 ~; 76 |; 30 &)
% ( 8 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 48 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f522,plain,
$false,
inference(avatar_sat_refutation,[],[f323,f419,f439,f473,f517]) ).
fof(f517,plain,
~ spl7_2,
inference(avatar_contradiction_clause,[],[f516]) ).
fof(f516,plain,
( $false
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f515,f247]) ).
fof(f247,plain,
forallprefers(false1,true),
inference(equality_resolution,[],[f246]) ).
fof(f246,plain,
! [X1] :
( forallprefers(false1,X1)
| true != X1 ),
inference(equality_resolution,[],[f212]) ).
fof(f212,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| false1 != X0
| true != X1 ),
inference(definition_unfolding,[],[f145,f177]) ).
fof(f177,plain,
false = false1,
inference(cnf_transformation,[],[f38]) ).
fof(f38,axiom,
false = false1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_false1) ).
fof(f145,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| false != X0
| true != X1 ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| ( ( false != X0
| true != X1 )
& ( ~ d(X0)
| bool(X0)
| ~ bool(X1)
| ~ d(X1) )
& ( ~ d(X1)
| d(X0) ) ) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,plain,
! [X0,X1] :
( ( ( ~ bool(X0)
& bool(X1)
& d(X0)
& d(X1) )
| ( true = X1
& false = X0 )
| ( d(X1)
& ~ d(X0) ) )
=> forallprefers(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( forallprefers(X0,X1)
<=> ( ( ~ bool(X0)
& bool(X1)
& d(X0)
& d(X1) )
| ( true = X1
& false = X0 )
| ( d(X1)
& ~ d(X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_forallprefers) ).
fof(f515,plain,
( ~ forallprefers(false1,true)
| ~ spl7_2 ),
inference(backward_demodulation,[],[f380,f510]) ).
fof(f510,plain,
( true = lazy_impl(prop(sK5),sK5)
| ~ spl7_2 ),
inference(subsumption_resolution,[],[f504,f190]) ).
fof(f190,plain,
true != err,
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
( false != err
& true != err
& false != true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct_false_true_err) ).
fof(f504,plain,
( true = lazy_impl(prop(sK5),sK5)
| true = err
| ~ spl7_2 ),
inference(superposition,[],[f244,f475]) ).
fof(f475,plain,
( true = lazy_impl(true,lazy_impl(prop(sK5),sK5))
| ~ spl7_2 ),
inference(forward_demodulation,[],[f239,f322]) ).
fof(f322,plain,
( true = false2
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f320]) ).
fof(f320,plain,
( spl7_2
<=> true = false2 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f239,plain,
false2 = lazy_impl(true,lazy_impl(prop(sK5),sK5)),
inference(definition_unfolding,[],[f195,f154,f142]) ).
fof(f142,plain,
! [X0] : lazy_impl(prop(X0),X0) = f7(X0),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X0] : lazy_impl(prop(X0),X0) = f7(X0),
inference(rectify,[],[f39]) ).
fof(f39,axiom,
! [X4] : f7(X4) = lazy_impl(prop(X4),X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_f7) ).
fof(f154,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(cnf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3] : phi(X3) = lazy_impl(true,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lazy_impl_axiom3) ).
fof(f195,plain,
false2 = phi(f7(sK5)),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
( false2 = phi(f7(sK5))
& ! [X1] : ~ forallprefers(f7(X1),f7(sK5)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f106,f132]) ).
fof(f132,plain,
( ? [X0] :
( false2 = phi(f7(X0))
& ! [X1] : ~ forallprefers(f7(X1),f7(X0)) )
=> ( false2 = phi(f7(sK5))
& ! [X1] : ~ forallprefers(f7(X1),f7(sK5)) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
? [X0] :
( false2 = phi(f7(X0))
& ! [X1] : ~ forallprefers(f7(X1),f7(X0)) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
? [X0] :
( ~ ? [X1] : forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(rectify,[],[f40]) ).
fof(f40,axiom,
? [X4] :
( false2 = phi(f7(X4))
& ~ ? [X9] : forallprefers(f7(X9),f7(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_false2) ).
fof(f244,plain,
! [X0] :
( lazy_impl(true,X0) = X0
| err = lazy_impl(true,X0) ),
inference(definition_unfolding,[],[f198,f154,f154]) ).
fof(f198,plain,
! [X0] :
( err = phi(X0)
| phi(X0) = X0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ( ~ d(X0)
& err = phi(X0) )
| ( d(X0)
& phi(X0) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_phi) ).
fof(f380,plain,
~ forallprefers(false1,lazy_impl(prop(sK5),sK5)),
inference(forward_demodulation,[],[f361,f279]) ).
fof(f279,plain,
false1 = lazy_impl(true,false1),
inference(resolution,[],[f242,f217]) ).
fof(f217,plain,
d(false1),
inference(definition_unfolding,[],[f153,f177]) ).
fof(f153,plain,
d(false),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
( d(false)
& d(err)
& d(true) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false_true_err_in_d) ).
fof(f242,plain,
! [X0] :
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(definition_unfolding,[],[f200,f154]) ).
fof(f200,plain,
! [X0] :
( ~ d(X0)
| phi(X0) = X0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f361,plain,
~ forallprefers(lazy_impl(true,false1),lazy_impl(prop(sK5),sK5)),
inference(superposition,[],[f240,f253]) ).
fof(f253,plain,
true = prop(false1),
inference(resolution,[],[f163,f248]) ).
fof(f248,plain,
bool(false1),
inference(equality_resolution,[],[f215]) ).
fof(f215,plain,
! [X0] :
( bool(X0)
| false1 != X0 ),
inference(definition_unfolding,[],[f148,f177]) ).
fof(f148,plain,
! [X0] :
( bool(X0)
| false != X0 ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ( false = X0
| true = X0
| ~ bool(X0) )
& ( bool(X0)
| ( false != X0
& true != X0 ) ) ),
inference(flattening,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ( false = X0
| true = X0
| ~ bool(X0) )
& ( bool(X0)
| ( false != X0
& true != X0 ) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( ( false = X0
| true = X0 )
<=> bool(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',def_bool) ).
fof(f163,plain,
! [X0] :
( ~ bool(X0)
| true = prop(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ( bool(X0)
| true != prop(X0) )
& ( true = prop(X0)
| ~ bool(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( bool(X0)
<=> true = prop(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop_true) ).
fof(f240,plain,
! [X1] : ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(sK5),sK5)),
inference(definition_unfolding,[],[f194,f142,f142]) ).
fof(f194,plain,
! [X1] : ~ forallprefers(f7(X1),f7(sK5)),
inference(cnf_transformation,[],[f133]) ).
fof(f473,plain,
~ spl7_7,
inference(avatar_contradiction_clause,[],[f472]) ).
fof(f472,plain,
( $false
| ~ spl7_7 ),
inference(subsumption_resolution,[],[f471,f171]) ).
fof(f171,plain,
false1 != false2,
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
false1 != false2,
inference(flattening,[],[f46]) ).
fof(f46,negated_conjecture,
false1 != false2,
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
false1 = false2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',false1_false2) ).
fof(f471,plain,
( false1 = false2
| ~ spl7_7 ),
inference(forward_demodulation,[],[f467,f279]) ).
fof(f467,plain,
( false2 = lazy_impl(true,false1)
| ~ spl7_7 ),
inference(backward_demodulation,[],[f466,f279]) ).
fof(f466,plain,
( false2 = lazy_impl(true,lazy_impl(true,false1))
| ~ spl7_7 ),
inference(forward_demodulation,[],[f465,f253]) ).
fof(f465,plain,
( false2 = lazy_impl(true,lazy_impl(prop(false1),false1))
| ~ spl7_7 ),
inference(forward_demodulation,[],[f239,f418]) ).
fof(f418,plain,
( false1 = sK5
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f416]) ).
fof(f416,plain,
( spl7_7
<=> false1 = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f439,plain,
( ~ spl7_1
| ~ spl7_6 ),
inference(avatar_contradiction_clause,[],[f438]) ).
fof(f438,plain,
( $false
| ~ spl7_1
| ~ spl7_6 ),
inference(subsumption_resolution,[],[f437,f247]) ).
fof(f437,plain,
( ~ forallprefers(false1,true)
| ~ spl7_1
| ~ spl7_6 ),
inference(forward_demodulation,[],[f421,f277]) ).
fof(f277,plain,
true = lazy_impl(true,true),
inference(resolution,[],[f242,f151]) ).
fof(f151,plain,
d(true),
inference(cnf_transformation,[],[f3]) ).
fof(f421,plain,
( ~ forallprefers(false1,lazy_impl(true,true))
| ~ spl7_1
| ~ spl7_6 ),
inference(backward_demodulation,[],[f381,f414]) ).
fof(f414,plain,
( true = sK5
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f412]) ).
fof(f412,plain,
( spl7_6
<=> true = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f381,plain,
( ~ forallprefers(false1,lazy_impl(true,sK5))
| ~ spl7_1 ),
inference(backward_demodulation,[],[f380,f318]) ).
fof(f318,plain,
( true = prop(sK5)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f316]) ).
fof(f316,plain,
( spl7_1
<=> true = prop(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f419,plain,
( spl7_6
| spl7_7
| ~ spl7_1 ),
inference(avatar_split_clause,[],[f407,f316,f416,f412]) ).
fof(f407,plain,
( false1 = sK5
| true = sK5
| ~ spl7_1 ),
inference(resolution,[],[f402,f214]) ).
fof(f214,plain,
! [X0] :
( ~ bool(X0)
| false1 = X0
| true = X0 ),
inference(definition_unfolding,[],[f149,f177]) ).
fof(f149,plain,
! [X0] :
( false = X0
| true = X0
| ~ bool(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f402,plain,
( bool(sK5)
| ~ spl7_1 ),
inference(trivial_inequality_removal,[],[f401]) ).
fof(f401,plain,
( true != true
| bool(sK5)
| ~ spl7_1 ),
inference(superposition,[],[f164,f318]) ).
fof(f164,plain,
! [X0] :
( true != prop(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f323,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f314,f320,f316]) ).
fof(f314,plain,
( true = false2
| true = prop(sK5) ),
inference(forward_demodulation,[],[f313,f277]) ).
fof(f313,plain,
( false2 = lazy_impl(true,true)
| true = prop(sK5) ),
inference(forward_demodulation,[],[f310,f213]) ).
fof(f213,plain,
! [X0] : true = lazy_impl(false1,X0),
inference(definition_unfolding,[],[f146,f177]) ).
fof(f146,plain,
! [X0] : true = lazy_impl(false,X0),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0] : true = lazy_impl(false,X0),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3] : true = lazy_impl(false,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lazy_impl_axiom2) ).
fof(f310,plain,
( false2 = lazy_impl(true,lazy_impl(false1,sK5))
| true = prop(sK5) ),
inference(superposition,[],[f239,f258]) ).
fof(f258,plain,
! [X0] :
( prop(X0) = false1
| true = prop(X0) ),
inference(resolution,[],[f238,f163]) ).
fof(f238,plain,
! [X0] :
( bool(X0)
| prop(X0) = false1 ),
inference(definition_unfolding,[],[f192,f177]) ).
fof(f192,plain,
! [X0] :
( false = prop(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ( ~ bool(X0)
| false != prop(X0) )
& ( false = prop(X0)
| bool(X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0] :
( ~ bool(X0)
<=> false = prop(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prop_false) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 20:16:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.55 % (19589)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.55 % (19587)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.55 % (19581)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55 % (19579)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.55 % (19573)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.55 % (19573)Instruction limit reached!
% 0.20/0.55 % (19573)------------------------------
% 0.20/0.55 % (19573)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (19573)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (19573)Termination reason: Unknown
% 0.20/0.55 % (19573)Termination phase: Preprocessing 1
% 0.20/0.55
% 0.20/0.55 % (19573)Memory used [KB]: 895
% 0.20/0.55 % (19573)Time elapsed: 0.005 s
% 0.20/0.55 % (19571)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (19573)Instructions burned: 2 (million)
% 0.20/0.55 % (19573)------------------------------
% 0.20/0.55 % (19573)------------------------------
% 1.61/0.56 % (19569)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.79/0.58 TRYING [3]
% 1.79/0.58 % (19589)First to succeed.
% 1.79/0.59 % (19593)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.79/0.59 % (19570)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.79/0.59 % (19589)Refutation found. Thanks to Tanya!
% 1.79/0.59 % SZS status Theorem for theBenchmark
% 1.79/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.79/0.59 % (19589)------------------------------
% 1.79/0.59 % (19589)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.79/0.59 % (19589)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.79/0.59 % (19589)Termination reason: Refutation
% 1.79/0.59
% 1.79/0.59 % (19589)Memory used [KB]: 5756
% 1.79/0.59 % (19589)Time elapsed: 0.174 s
% 1.79/0.59 % (19589)Instructions burned: 15 (million)
% 1.79/0.59 % (19589)------------------------------
% 1.79/0.59 % (19589)------------------------------
% 1.79/0.59 % (19564)Success in time 0.249 s
%------------------------------------------------------------------------------