TSTP Solution File: SEU160+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU160+1 : TPTP v8.1.0. Released v3.3.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 : n003.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.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 104 ( 63 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 109 ( 40 ~; 48 |; 16 &)
% ( 3 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 35 ( 25 !; 10 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_4,type,
sQ5_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_5,type,
sQ6_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_6,type,
sQ7_eqProxy: ( $real * $real ) > $o ).
fof(f95,plain,
$false,
inference(subsumption_resolution,[],[f90,f92]) ).
fof(f92,plain,
! [X1] : subset(sK3,singleton(X1)),
inference(backward_demodulation,[],[f39,f89]) ).
fof(f89,plain,
empty_set = sK3,
inference(subsumption_resolution,[],[f88,f42]) ).
fof(f42,plain,
! [X0] : subset(X0,X0),
inference(literal_reordering,[],[f25]) ).
fof(f25,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1] : subset(X1,X1),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X1,X0] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f88,plain,
( empty_set = sK3
| ~ subset(sK3,sK3) ),
inference(trivial_inequality_removal,[],[f84]) ).
fof(f84,plain,
( empty_set = sK3
| ~ subset(sK3,sK3)
| sK3 != sK3 ),
inference(superposition,[],[f38,f81]) ).
fof(f81,plain,
( sK3 = singleton(sK2)
| empty_set = sK3 ),
inference(duplicate_literal_removal,[],[f80]) ).
fof(f80,plain,
( sK3 = singleton(sK2)
| sK3 = singleton(sK2)
| empty_set = sK3
| empty_set = sK3 ),
inference(resolution,[],[f45,f37]) ).
fof(f37,plain,
( subset(sK3,singleton(sK2))
| sK3 = singleton(sK2)
| empty_set = sK3 ),
inference(literal_reordering,[],[f31]) ).
fof(f31,plain,
( subset(sK3,singleton(sK2))
| sK3 = singleton(sK2)
| empty_set = sK3 ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( ( ~ subset(sK3,singleton(sK2))
| ( sK3 != singleton(sK2)
& empty_set != sK3 ) )
& ( subset(sK3,singleton(sK2))
| sK3 = singleton(sK2)
| empty_set = sK3 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f21,f22]) ).
fof(f22,plain,
( ? [X0,X1] :
( ( ~ subset(X1,singleton(X0))
| ( singleton(X0) != X1
& empty_set != X1 ) )
& ( subset(X1,singleton(X0))
| singleton(X0) = X1
| empty_set = X1 ) )
=> ( ( ~ subset(sK3,singleton(sK2))
| ( sK3 != singleton(sK2)
& empty_set != sK3 ) )
& ( subset(sK3,singleton(sK2))
| sK3 = singleton(sK2)
| empty_set = sK3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1] :
( ( ~ subset(X1,singleton(X0))
| ( singleton(X0) != X1
& empty_set != X1 ) )
& ( subset(X1,singleton(X0))
| singleton(X0) = X1
| empty_set = X1 ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
? [X1,X0] :
( ( ~ subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( subset(X0,singleton(X1))
| singleton(X1) = X0
| empty_set = X0 ) ),
inference(flattening,[],[f19]) ).
fof(f19,plain,
? [X1,X0] :
( ( ~ subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( subset(X0,singleton(X1))
| singleton(X1) = X0
| empty_set = X0 ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
? [X1,X0] :
( ( singleton(X1) = X0
| empty_set = X0 )
<~> subset(X0,singleton(X1)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(f45,plain,
! [X0,X1] :
( ~ subset(X0,singleton(X1))
| singleton(X1) = X0
| empty_set = X0 ),
inference(literal_reordering,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( singleton(X1) = X0
| ~ subset(X0,singleton(X1))
| empty_set = X0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( subset(X0,singleton(X1))
| ( singleton(X1) != X0
& empty_set != X0 ) )
& ( singleton(X1) = X0
| empty_set = X0
| ~ subset(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( subset(X0,singleton(X1))
<=> ( singleton(X1) = X0
| empty_set = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(f38,plain,
( ~ subset(sK3,singleton(sK2))
| sK3 != singleton(sK2) ),
inference(literal_reordering,[],[f33]) ).
fof(f33,plain,
( ~ subset(sK3,singleton(sK2))
| sK3 != singleton(sK2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f39,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(literal_reordering,[],[f35]) ).
fof(f35,plain,
! [X1] : subset(empty_set,singleton(X1)),
inference(equality_resolution,[],[f29]) ).
fof(f29,plain,
! [X0,X1] :
( subset(X0,singleton(X1))
| empty_set != X0 ),
inference(cnf_transformation,[],[f18]) ).
fof(f90,plain,
~ subset(sK3,singleton(sK2)),
inference(subsumption_resolution,[],[f44,f89]) ).
fof(f44,plain,
( ~ subset(sK3,singleton(sK2))
| empty_set != sK3 ),
inference(literal_reordering,[],[f32]) ).
fof(f32,plain,
( ~ subset(sK3,singleton(sK2))
| empty_set != sK3 ),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU160+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % 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 : n003.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:43:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.52 % (3935)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 (3000ds/68Mi)
% 0.20/0.53 % (3935)First to succeed.
% 0.20/0.53 % (3929)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.53 % (3929)Instruction limit reached!
% 0.20/0.53 % (3929)------------------------------
% 0.20/0.53 % (3929)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (3929)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (3929)Termination reason: Unknown
% 0.20/0.53 % (3929)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (3929)Memory used [KB]: 5373
% 0.20/0.53 % (3929)Time elapsed: 0.002 s
% 0.20/0.53 % (3929)Instructions burned: 2 (million)
% 0.20/0.53 % (3929)------------------------------
% 0.20/0.53 % (3929)------------------------------
% 0.20/0.53 % (3935)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (3935)------------------------------
% 0.20/0.53 % (3935)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (3935)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (3935)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (3935)Memory used [KB]: 5756
% 0.20/0.53 % (3935)Time elapsed: 0.008 s
% 0.20/0.53 % (3935)Instructions burned: 4 (million)
% 0.20/0.53 % (3935)------------------------------
% 0.20/0.53 % (3935)------------------------------
% 0.20/0.53 % (3920)Success in time 0.187 s
%------------------------------------------------------------------------------