TSTP Solution File: SWC349+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC349+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n017.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 18:40:38 EDT 2022
% Result : Theorem 0.20s 0.57s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 119 ( 42 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 123 ( 24 ~; 10 |; 76 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 35 ( 11 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f158,plain,
$false,
inference(subsumption_resolution,[],[f156,f153]) ).
fof(f153,plain,
~ frontsegP(sK2,nil),
inference(backward_demodulation,[],[f138,f152]) ).
fof(f152,plain,
nil = sK1,
inference(forward_demodulation,[],[f139,f141]) ).
fof(f141,plain,
nil = sK3,
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
( ssList(sK1)
& ssList(sK2)
& neq(sK2,nil)
& nil = sK3
& sK4 = sK2
& sK1 = sK3
& ~ frontsegP(sK2,sK1)
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f109,f122,f121,f120,f119]) ).
fof(f119,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( neq(X1,nil)
& nil = X2
& X1 = X3
& X0 = X2
& ~ frontsegP(X1,X0)
& ssList(X3) )
& ssList(X2) ) ) )
=> ( ssList(sK1)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( neq(X1,nil)
& nil = X2
& X1 = X3
& sK1 = X2
& ~ frontsegP(X1,sK1)
& ssList(X3) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( neq(X1,nil)
& nil = X2
& X1 = X3
& sK1 = X2
& ~ frontsegP(X1,sK1)
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK2)
& ? [X2] :
( ? [X3] :
( neq(sK2,nil)
& nil = X2
& sK2 = X3
& sK1 = X2
& ~ frontsegP(sK2,sK1)
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X2] :
( ? [X3] :
( neq(sK2,nil)
& nil = X2
& sK2 = X3
& sK1 = X2
& ~ frontsegP(sK2,sK1)
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( neq(sK2,nil)
& nil = sK3
& sK2 = X3
& sK1 = sK3
& ~ frontsegP(sK2,sK1)
& ssList(X3) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X3] :
( neq(sK2,nil)
& nil = sK3
& sK2 = X3
& sK1 = sK3
& ~ frontsegP(sK2,sK1)
& ssList(X3) )
=> ( neq(sK2,nil)
& nil = sK3
& sK4 = sK2
& sK1 = sK3
& ~ frontsegP(sK2,sK1)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( neq(X1,nil)
& nil = X2
& X1 = X3
& X0 = X2
& ~ frontsegP(X1,X0)
& ssList(X3) )
& ssList(X2) ) ) ),
inference(flattening,[],[f108]) ).
fof(f108,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ frontsegP(X1,X0)
& X0 = X2
& nil = X2
& neq(X1,nil)
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X0)
| X0 != X2
| nil != X2
| ~ neq(X1,nil)
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X0)
| X0 != X2
| nil != X2
| ~ neq(X1,nil)
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f139,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f123]) ).
fof(f138,plain,
~ frontsegP(sK2,sK1),
inference(cnf_transformation,[],[f123]) ).
fof(f156,plain,
frontsegP(sK2,nil),
inference(unit_resulting_resolution,[],[f143,f145]) ).
fof(f145,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| frontsegP(X0,nil) ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f143,plain,
ssList(sK2),
inference(cnf_transformation,[],[f123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC349+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 18:13:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.55 % (11401)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (11426)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.56 % (11418)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.57 % (11409)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.57 % (11406)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.57 % (11401)First to succeed.
% 0.20/0.57 % (11401)Refutation found. Thanks to Tanya!
% 0.20/0.57 % SZS status Theorem for theBenchmark
% 0.20/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57 % (11401)------------------------------
% 0.20/0.57 % (11401)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (11401)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (11401)Termination reason: Refutation
% 0.20/0.57
% 0.20/0.57 % (11401)Memory used [KB]: 6012
% 0.20/0.57 % (11401)Time elapsed: 0.141 s
% 0.20/0.57 % (11401)Instructions burned: 3 (million)
% 0.20/0.57 % (11401)------------------------------
% 0.20/0.57 % (11401)------------------------------
% 0.20/0.57 % (11397)Success in time 0.221 s
%------------------------------------------------------------------------------