TSTP Solution File: SEU250+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU250+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 : n027.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:49 EDT 2022
% Result : Theorem 1.62s 0.60s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 118 ( 3 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 118 ( 46 ~; 42 |; 17 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 52 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f516,plain,
$false,
inference(avatar_sat_refutation,[],[f162,f479,f515]) ).
fof(f515,plain,
spl12_1,
inference(avatar_contradiction_clause,[],[f514]) ).
fof(f514,plain,
( $false
| spl12_1 ),
inference(subsumption_resolution,[],[f513,f157]) ).
fof(f157,plain,
( ~ subset(sF10,sF11)
| spl12_1 ),
inference(avatar_component_clause,[],[f155]) ).
fof(f155,plain,
( spl12_1
<=> subset(sF10,sF11) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f513,plain,
subset(sF10,sF11),
inference(duplicate_literal_removal,[],[f509]) ).
fof(f509,plain,
( subset(sF10,sF11)
| subset(sF10,sF11) ),
inference(resolution,[],[f283,f107]) ).
fof(f107,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f81,f82]) ).
fof(f82,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) )
=> ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f81,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( in(X3,X0)
& ~ in(X3,X1) ) ) ),
inference(rectify,[],[f80]) ).
fof(f80,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f74]) ).
fof(f74,plain,
! [X1,X0] :
( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( ! [X2] :
( in(X2,X1)
=> in(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f283,plain,
! [X0] :
( in(sK0(sF10,X0),sF11)
| subset(sF10,X0) ),
inference(resolution,[],[f282,f108]) ).
fof(f108,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
fof(f282,plain,
! [X0] :
( ~ in(X0,sF10)
| in(X0,sF11) ),
inference(forward_demodulation,[],[f281,f152]) ).
fof(f152,plain,
relation_field(sK6) = sF11,
introduced(function_definition,[]) ).
fof(f281,plain,
! [X0] :
( ~ in(X0,sF10)
| in(X0,relation_field(sK6)) ),
inference(forward_demodulation,[],[f280,f151]) ).
fof(f151,plain,
relation_field(sF9) = sF10,
introduced(function_definition,[]) ).
fof(f280,plain,
! [X0] :
( ~ in(X0,relation_field(sF9))
| in(X0,relation_field(sK6)) ),
inference(subsumption_resolution,[],[f278,f134]) ).
fof(f134,plain,
relation(sK6),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
( relation(sK6)
& ( ~ subset(relation_field(relation_restriction(sK6,sK5)),relation_field(sK6))
| ~ subset(relation_field(relation_restriction(sK6,sK5)),sK5) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f76,f99]) ).
fof(f99,plain,
( ? [X0,X1] :
( relation(X1)
& ( ~ subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
| ~ subset(relation_field(relation_restriction(X1,X0)),X0) ) )
=> ( relation(sK6)
& ( ~ subset(relation_field(relation_restriction(sK6,sK5)),relation_field(sK6))
| ~ subset(relation_field(relation_restriction(sK6,sK5)),sK5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
? [X0,X1] :
( relation(X1)
& ( ~ subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
| ~ subset(relation_field(relation_restriction(X1,X0)),X0) ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,negated_conjecture,
~ ! [X0,X1] :
( relation(X1)
=> ( subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
& subset(relation_field(relation_restriction(X1,X0)),X0) ) ),
inference(negated_conjecture,[],[f34]) ).
fof(f34,conjecture,
! [X0,X1] :
( relation(X1)
=> ( subset(relation_field(relation_restriction(X1,X0)),relation_field(X1))
& subset(relation_field(relation_restriction(X1,X0)),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_wellord1) ).
fof(f278,plain,
! [X0] :
( in(X0,relation_field(sK6))
| ~ in(X0,relation_field(sF9))
| ~ relation(sK6) ),
inference(superposition,[],[f115,f150]) ).
fof(f150,plain,
sF9 = relation_restriction(sK6,sK5),
introduced(function_definition,[]) ).
fof(f115,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2)
| in(X0,relation_field(X2)) ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0,X1,X2] :
( ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2)
| ( in(X0,relation_field(X2))
& in(X0,X1) ) ),
inference(flattening,[],[f66]) ).
fof(f66,plain,
! [X0,X2,X1] :
( ( in(X0,relation_field(X2))
& in(X0,X1) )
| ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,axiom,
! [X0,X2,X1] :
( relation(X2)
=> ( in(X0,relation_field(relation_restriction(X2,X1)))
=> ( in(X0,relation_field(X2))
& in(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_wellord1) ).
fof(f479,plain,
spl12_2,
inference(avatar_split_clause,[],[f478,f159]) ).
fof(f159,plain,
( spl12_2
<=> subset(sF10,sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f478,plain,
subset(sF10,sK5),
inference(duplicate_literal_removal,[],[f474]) ).
fof(f474,plain,
( subset(sF10,sK5)
| subset(sF10,sK5) ),
inference(resolution,[],[f259,f107]) ).
fof(f259,plain,
! [X0] :
( in(sK0(sF10,X0),sK5)
| subset(sF10,X0) ),
inference(resolution,[],[f258,f108]) ).
fof(f258,plain,
! [X0] :
( ~ in(X0,sF10)
| in(X0,sK5) ),
inference(forward_demodulation,[],[f257,f151]) ).
fof(f257,plain,
! [X0] :
( in(X0,sK5)
| ~ in(X0,relation_field(sF9)) ),
inference(subsumption_resolution,[],[f256,f134]) ).
fof(f256,plain,
! [X0] :
( ~ relation(sK6)
| ~ in(X0,relation_field(sF9))
| in(X0,sK5) ),
inference(superposition,[],[f114,f150]) ).
fof(f114,plain,
! [X2,X0,X1] :
( ~ in(X0,relation_field(relation_restriction(X2,X1)))
| ~ relation(X2)
| in(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f162,plain,
( ~ spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f153,f159,f155]) ).
fof(f153,plain,
( ~ subset(sF10,sK5)
| ~ subset(sF10,sF11) ),
inference(definition_folding,[],[f133,f151,f150,f152,f151,f150]) ).
fof(f133,plain,
( ~ subset(relation_field(relation_restriction(sK6,sK5)),relation_field(sK6))
| ~ subset(relation_field(relation_restriction(sK6,sK5)),sK5) ),
inference(cnf_transformation,[],[f100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU250+1 : TPTP v8.1.0. Released v3.3.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 : n027.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:13:01 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.55 % (6860)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.55 % (6858)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.56 % (6876)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.19/0.56 TRYING [1]
% 0.19/0.56 % (6868)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.56 % (6860)Instruction limit reached!
% 0.19/0.56 % (6860)------------------------------
% 0.19/0.56 % (6860)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (6860)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (6860)Termination reason: Unknown
% 0.19/0.56 % (6860)Termination phase: Blocked clause elimination
% 0.19/0.56
% 0.19/0.56 % (6860)Memory used [KB]: 895
% 0.19/0.56 % (6860)Time elapsed: 0.004 s
% 0.19/0.56 % (6860)Instructions burned: 2 (million)
% 0.19/0.56 % (6860)------------------------------
% 0.19/0.56 % (6860)------------------------------
% 0.19/0.56 % (6874)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.56 TRYING [2]
% 0.19/0.57 TRYING [3]
% 0.19/0.57 % (6866)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 (2999ds/68Mi)
% 0.19/0.58 TRYING [4]
% 0.19/0.60 % (6876)First to succeed.
% 1.62/0.60 % (6876)Refutation found. Thanks to Tanya!
% 1.62/0.60 % SZS status Theorem for theBenchmark
% 1.62/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.62/0.60 % (6876)------------------------------
% 1.62/0.60 % (6876)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.62/0.60 % (6876)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.62/0.60 % (6876)Termination reason: Refutation
% 1.62/0.60
% 1.62/0.60 % (6876)Memory used [KB]: 5756
% 1.62/0.60 % (6876)Time elapsed: 0.158 s
% 1.62/0.60 % (6876)Instructions burned: 14 (million)
% 1.62/0.60 % (6876)------------------------------
% 1.62/0.60 % (6876)------------------------------
% 1.62/0.60 % (6850)Success in time 0.245 s
%------------------------------------------------------------------------------