TSTP Solution File: SEU167+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU167+3 : TPTP v8.1.0. Released v3.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 : 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:32:17 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 6 unt; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 80 ( 29 ~; 20 |; 21 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 53 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73,plain,
$false,
inference(avatar_sat_refutation,[],[f67,f70,f72]) ).
fof(f72,plain,
spl6_2,
inference(avatar_contradiction_clause,[],[f71]) ).
fof(f71,plain,
( $false
| spl6_2 ),
inference(resolution,[],[f66,f31]) ).
fof(f31,plain,
subset(sK1,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( subset(sK4,sK2)
& subset(sK1,sK3)
& ~ subset(cartesian_product2(sK1,sK4),cartesian_product2(sK3,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1,X2,X3] :
( subset(X3,X1)
& subset(X0,X2)
& ~ subset(cartesian_product2(X0,X3),cartesian_product2(X2,X1)) )
=> ( subset(sK4,sK2)
& subset(sK1,sK3)
& ~ subset(cartesian_product2(sK1,sK4),cartesian_product2(sK3,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1,X2,X3] :
( subset(X3,X1)
& subset(X0,X2)
& ~ subset(cartesian_product2(X0,X3),cartesian_product2(X2,X1)) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
? [X0,X1,X3,X2] :
( subset(X2,X1)
& subset(X0,X3)
& ~ subset(cartesian_product2(X0,X2),cartesian_product2(X3,X1)) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
? [X3,X0,X1,X2] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X3,X1))
& subset(X2,X1)
& subset(X0,X3) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
~ ! [X3,X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X3) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X3,X1)) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X3,X2,X1] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X3,X2,X1] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(f66,plain,
( ~ subset(sK1,sK3)
| spl6_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f64,plain,
( spl6_2
<=> subset(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f70,plain,
spl6_1,
inference(avatar_contradiction_clause,[],[f68]) ).
fof(f68,plain,
( $false
| spl6_1 ),
inference(resolution,[],[f62,f32]) ).
fof(f32,plain,
subset(sK4,sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f62,plain,
( ~ subset(sK4,sK2)
| spl6_1 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f60,plain,
( spl6_1
<=> subset(sK4,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f67,plain,
( ~ spl6_1
| ~ spl6_2 ),
inference(avatar_split_clause,[],[f54,f64,f60]) ).
fof(f54,plain,
( ~ subset(sK1,sK3)
| ~ subset(sK4,sK2) ),
inference(resolution,[],[f42,f30]) ).
fof(f30,plain,
~ subset(cartesian_product2(sK1,sK4),cartesian_product2(sK3,sK2)),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X6,X7,X4,X5] :
( subset(cartesian_product2(X4,X6),cartesian_product2(X5,X7))
| ~ subset(X6,X7)
| ~ subset(X4,X5) ),
inference(resolution,[],[f38,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X1,X0),cartesian_product2(X1,X2))
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ subset(X0,X2)
| ( subset(cartesian_product2(X1,X0),cartesian_product2(X1,X2))
& subset(cartesian_product2(X0,X1),cartesian_product2(X2,X1)) ) ),
inference(rectify,[],[f14]) ).
fof(f14,plain,
! [X1,X0,X2] :
( ~ subset(X1,X2)
| ( subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2))
& subset(cartesian_product2(X1,X0),cartesian_product2(X2,X0)) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X2,X1] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X0,X1),cartesian_product2(X0,X2))
& subset(cartesian_product2(X1,X0),cartesian_product2(X2,X0)) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
& subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(f38,plain,
! [X2,X3,X0,X1] :
( ~ subset(cartesian_product2(X1,X2),X3)
| ~ subset(X0,X1)
| subset(cartesian_product2(X0,X2),X3) ),
inference(resolution,[],[f28,f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ subset(X2,X0)
| subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X2,X1)
| ~ subset(X0,X1)
| ~ subset(X2,X0) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X0,X2,X1] :
( subset(X2,X1)
| ~ subset(X2,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X2,X1] :
( ( subset(X2,X0)
& subset(X0,X1) )
=> subset(X2,X1) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X2,X0] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f28,plain,
! [X2,X0,X1] :
( subset(cartesian_product2(X0,X1),cartesian_product2(X2,X1))
| ~ subset(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU167+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/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.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 14:09:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (1546)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.19/0.50 % (1554)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.19/0.50 % (1554)First to succeed.
% 0.19/0.50 % (1554)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (1554)------------------------------
% 0.19/0.50 % (1554)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (1554)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (1554)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (1554)Memory used [KB]: 5373
% 0.19/0.50 % (1554)Time elapsed: 0.099 s
% 0.19/0.50 % (1554)Instructions burned: 2 (million)
% 0.19/0.50 % (1554)------------------------------
% 0.19/0.50 % (1554)------------------------------
% 0.19/0.50 % (1539)Success in time 0.151 s
%------------------------------------------------------------------------------