TSTP Solution File: SYN941+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN941+1 : TPTP v8.1.0. Released v3.1.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 : n006.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:36:09 EDT 2022
% Result : Theorem 1.47s 0.57s
% Output : Refutation 1.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 86 ( 33 ~; 22 |; 21 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 34 ( 24 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,plain,
$false,
inference(subsumption_resolution,[],[f7,f14]) ).
fof(f14,plain,
! [X0] : ~ q(X0),
inference(resolution,[],[f13,f7]) ).
fof(f13,plain,
! [X0,X1] :
( ~ q(f(X1))
| ~ q(X0) ),
inference(resolution,[],[f10,f12]) ).
fof(f12,plain,
! [X3] :
( ~ p(X3)
| ~ q(X3) ),
inference(subsumption_resolution,[],[f11,f8]) ).
fof(f8,plain,
! [X2,X3] :
( r(X2)
| ~ q(X3)
| ~ p(X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f6,plain,
( ! [X2,X3] :
( ( p(f(X2))
& ( ~ p(X3)
| ( ( ~ r(sK1)
| ~ r(sK0) )
& r(X2) ) ) )
| ~ q(X3) )
& q(f(sK1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).
fof(f5,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ( p(f(X2))
& ( ~ p(X3)
| ( ( ~ r(X1)
| ~ r(X0) )
& r(X2) ) ) )
| ~ q(X3) )
& q(f(X1)) )
=> ( ! [X3,X2] :
( ( p(f(X2))
& ( ~ p(X3)
| ( ( ~ r(sK1)
| ~ r(sK0) )
& r(X2) ) ) )
| ~ q(X3) )
& q(f(sK1)) ) ),
introduced(choice_axiom,[]) ).
fof(f4,plain,
? [X0,X1] :
( ! [X2,X3] :
( ( p(f(X2))
& ( ~ p(X3)
| ( ( ~ r(X1)
| ~ r(X0) )
& r(X2) ) ) )
| ~ q(X3) )
& q(f(X1)) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X1,X0] :
( q(f(X1))
=> ? [X3,X2] :
( q(X3)
& ( p(f(X2))
=> ( ( r(X2)
=> ( r(X1)
& r(X0) ) )
& p(X3) ) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X1,X0] :
( q(f(X0))
=> ? [X3,X2] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X0)
& r(X1) ) )
& p(X2) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X1,X0] :
( q(f(X0))
=> ? [X3,X2] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X0)
& r(X1) ) )
& p(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f11,plain,
! [X3] :
( ~ q(X3)
| ~ r(sK1)
| ~ p(X3) ),
inference(subsumption_resolution,[],[f9,f8]) ).
fof(f9,plain,
! [X3] :
( ~ r(sK0)
| ~ r(sK1)
| ~ q(X3)
| ~ p(X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f10,plain,
! [X2,X3] :
( p(f(X2))
| ~ q(X3) ),
inference(cnf_transformation,[],[f6]) ).
fof(f7,plain,
q(f(sK1)),
inference(cnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN941+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 23:08:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.47/0.56 % (16062)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)
% 1.47/0.56 % (16054)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)
% 1.47/0.56 % (16046)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 1.47/0.57 % (16046)First to succeed.
% 1.47/0.57 % (16046)Refutation found. Thanks to Tanya!
% 1.47/0.57 % SZS status Theorem for theBenchmark
% 1.47/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.47/0.57 % (16046)------------------------------
% 1.47/0.57 % (16046)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.47/0.57 % (16046)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.47/0.57 % (16046)Termination reason: Refutation
% 1.47/0.57
% 1.47/0.57 % (16046)Memory used [KB]: 1407
% 1.47/0.57 % (16046)Time elapsed: 0.140 s
% 1.47/0.57 % (16046)Instructions burned: 2 (million)
% 1.47/0.57 % (16046)------------------------------
% 1.47/0.57 % (16046)------------------------------
% 1.47/0.57 % (16033)Success in time 0.214 s
%------------------------------------------------------------------------------