TSTP Solution File: SEU160+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU160+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 : n001.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:14 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 5 unt; 0 def)
% Number of atoms : 136 ( 60 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 144 ( 53 ~; 65 |; 16 &)
% ( 8 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 34 ( 26 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,plain,
$false,
inference(avatar_sat_refutation,[],[f47,f48,f49,f53,f59,f64]) ).
fof(f64,plain,
( spl4_2
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f63]) ).
fof(f63,plain,
( $false
| spl4_2
| ~ spl4_3 ),
inference(subsumption_resolution,[],[f60,f31]) ).
fof(f31,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f60,plain,
( ~ subset(sK3,sK3)
| spl4_2
| ~ spl4_3 ),
inference(backward_demodulation,[],[f41,f46]) ).
fof(f46,plain,
( sK3 = singleton(sK2)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl4_3
<=> sK3 = singleton(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f41,plain,
( ~ subset(sK3,singleton(sK2))
| spl4_2 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl4_2
<=> subset(sK3,singleton(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f59,plain,
( spl4_1
| ~ spl4_2
| spl4_3 ),
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f58,plain,
( $false
| spl4_1
| ~ spl4_2
| spl4_3 ),
inference(subsumption_resolution,[],[f57,f37]) ).
fof(f37,plain,
( empty_set != sK3
| spl4_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl4_1
<=> empty_set = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f57,plain,
( empty_set = sK3
| ~ spl4_2
| spl4_3 ),
inference(subsumption_resolution,[],[f55,f45]) ).
fof(f45,plain,
( sK3 != singleton(sK2)
| spl4_3 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f55,plain,
( sK3 = singleton(sK2)
| empty_set = sK3
| ~ spl4_2 ),
inference(resolution,[],[f25,f42]) ).
fof(f42,plain,
( subset(sK3,singleton(sK2))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f25,plain,
! [X0,X1] :
( ~ subset(X0,singleton(X1))
| singleton(X1) = X0
| empty_set = X0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) )
& ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( ( singleton(X0) = X1
| empty_set = X1
| ~ subset(X1,singleton(X0)) )
& ( subset(X1,singleton(X0))
| ( singleton(X0) != X1
& empty_set != X1 ) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X1,X0] :
( ( singleton(X0) = X1
| empty_set = X1
| ~ subset(X1,singleton(X0)) )
& ( subset(X1,singleton(X0))
| ( singleton(X0) != X1
& empty_set != X1 ) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1,X0] :
( ( singleton(X0) = X1
| empty_set = X1 )
<=> subset(X1,singleton(X0)) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( subset(X0,singleton(X1))
<=> ( empty_set = X0
| singleton(X1) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f53,plain,
( ~ spl4_1
| spl4_2 ),
inference(avatar_contradiction_clause,[],[f52]) ).
fof(f52,plain,
( $false
| ~ spl4_1
| spl4_2 ),
inference(subsumption_resolution,[],[f41,f51]) ).
fof(f51,plain,
( ! [X1] : subset(sK3,singleton(X1))
| ~ spl4_1 ),
inference(forward_demodulation,[],[f34,f38]) ).
fof(f38,plain,
( empty_set = sK3
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f34,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(equality_resolution,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,singleton(X1))
| empty_set != X0 ),
inference(cnf_transformation,[],[f14]) ).
fof(f49,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f30,f40,f36]) ).
fof(f30,plain,
( ~ subset(sK3,singleton(sK2))
| empty_set != sK3 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ( ~ subset(sK3,singleton(sK2))
| ( empty_set != sK3
& sK3 != singleton(sK2) ) )
& ( subset(sK3,singleton(sK2))
| empty_set = sK3
| sK3 = singleton(sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f20,f21]) ).
fof(f21,plain,
( ? [X0,X1] :
( ( ~ subset(X1,singleton(X0))
| ( empty_set != X1
& singleton(X0) != X1 ) )
& ( subset(X1,singleton(X0))
| empty_set = X1
| singleton(X0) = X1 ) )
=> ( ( ~ subset(sK3,singleton(sK2))
| ( empty_set != sK3
& sK3 != singleton(sK2) ) )
& ( subset(sK3,singleton(sK2))
| empty_set = sK3
| sK3 = singleton(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( ( ~ subset(X1,singleton(X0))
| ( empty_set != X1
& singleton(X0) != X1 ) )
& ( subset(X1,singleton(X0))
| empty_set = X1
| singleton(X0) = X1 ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X0,X1] :
( ( ~ subset(X1,singleton(X0))
| ( empty_set != X1
& singleton(X0) != X1 ) )
& ( subset(X1,singleton(X0))
| empty_set = X1
| singleton(X0) = X1 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0,X1] :
( ( empty_set = X1
| singleton(X0) = X1 )
<~> subset(X1,singleton(X0)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
~ ! [X1,X0] :
( ( empty_set = X1
| singleton(X0) = X1 )
<=> subset(X1,singleton(X0)) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X1,X0] :
( subset(X0,singleton(X1))
<=> ( empty_set = X0
| singleton(X1) = X0 ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X1,X0] :
( subset(X0,singleton(X1))
<=> ( empty_set = X0
| singleton(X1) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f48,plain,
( ~ spl4_3
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f29,f40,f44]) ).
fof(f29,plain,
( ~ subset(sK3,singleton(sK2))
| sK3 != singleton(sK2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f47,plain,
( spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_split_clause,[],[f28,f44,f40,f36]) ).
fof(f28,plain,
( sK3 = singleton(sK2)
| subset(sK3,singleton(sK2))
| empty_set = sK3 ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : n001.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 15:04:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (31638)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.50 % (31639)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 (3000ds/48Mi)
% 0.20/0.50 % (31639)First to succeed.
% 0.20/0.50 % (31638)Also succeeded, but the first one will report.
% 0.20/0.50 % (31639)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (31639)------------------------------
% 0.20/0.50 % (31639)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (31639)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (31639)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (31639)Memory used [KB]: 5373
% 0.20/0.50 % (31639)Time elapsed: 0.108 s
% 0.20/0.50 % (31639)Instructions burned: 2 (million)
% 0.20/0.50 % (31639)------------------------------
% 0.20/0.50 % (31639)------------------------------
% 0.20/0.50 % (31633)Success in time 0.151 s
%------------------------------------------------------------------------------