TSTP Solution File: SEU159+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU159+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 : n012.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.19s 0.58s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 60 ( 11 unt; 0 def)
% Number of atoms : 231 ( 75 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 263 ( 92 ~; 107 |; 48 &)
% ( 10 <=>; 5 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 114 ( 92 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f145,plain,
$false,
inference(subsumption_resolution,[],[f144,f96]) ).
fof(f96,plain,
~ subset(sF7,sK3),
inference(subsumption_resolution,[],[f94,f82]) ).
fof(f82,plain,
in(sK2,sK3),
inference(duplicate_literal_removal,[],[f80]) ).
fof(f80,plain,
( in(sK2,sK3)
| in(sK2,sK3) ),
inference(resolution,[],[f76,f64]) ).
fof(f64,plain,
in(sK2,sF7),
inference(superposition,[],[f56,f59]) ).
fof(f59,plain,
unordered_pair(sK2,sK4) = sF7,
introduced(function_definition,[]) ).
fof(f56,plain,
! [X3,X1] : in(X3,unordered_pair(X3,X1)),
inference(equality_resolution,[],[f55]) ).
fof(f55,plain,
! [X3,X0,X1] :
( in(X3,X0)
| unordered_pair(X3,X1) != X0 ),
inference(equality_resolution,[],[f41]) ).
fof(f41,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| X2 != X3
| unordered_pair(X2,X1) != X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( X2 = X3
| X1 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| ( X2 != X3
& X1 != X3 ) ) )
| unordered_pair(X2,X1) != X0 )
& ( unordered_pair(X2,X1) = X0
| ( ( ~ in(sK0(X0,X1,X2),X0)
| ( sK0(X0,X1,X2) != X2
& sK0(X0,X1,X2) != X1 ) )
& ( in(sK0(X0,X1,X2),X0)
| sK0(X0,X1,X2) = X2
| sK0(X0,X1,X2) = X1 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ? [X4] :
( ( ~ in(X4,X0)
| ( X2 != X4
& X1 != X4 ) )
& ( in(X4,X0)
| X2 = X4
| X1 = X4 ) )
=> ( ( ~ in(sK0(X0,X1,X2),X0)
| ( sK0(X0,X1,X2) != X2
& sK0(X0,X1,X2) != X1 ) )
& ( in(sK0(X0,X1,X2),X0)
| sK0(X0,X1,X2) = X2
| sK0(X0,X1,X2) = X1 ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( X2 = X3
| X1 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| ( X2 != X3
& X1 != X3 ) ) )
| unordered_pair(X2,X1) != X0 )
& ( unordered_pair(X2,X1) = X0
| ? [X4] :
( ( ~ in(X4,X0)
| ( X2 != X4
& X1 != X4 ) )
& ( in(X4,X0)
| X2 = X4
| X1 = X4 ) ) ) ),
inference(rectify,[],[f18]) ).
fof(f18,plain,
! [X0,X2,X1] :
( ( ! [X3] :
( ( X1 = X3
| X2 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| ( X1 != X3
& X2 != X3 ) ) )
| unordered_pair(X1,X2) != X0 )
& ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| ( X1 != X3
& X2 != X3 ) )
& ( in(X3,X0)
| X1 = X3
| X2 = X3 ) ) ) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
! [X0,X2,X1] :
( ( ! [X3] :
( ( X1 = X3
| X2 = X3
| ~ in(X3,X0) )
& ( in(X3,X0)
| ( X1 != X3
& X2 != X3 ) ) )
| unordered_pair(X1,X2) != X0 )
& ( unordered_pair(X1,X2) = X0
| ? [X3] :
( ( ~ in(X3,X0)
| ( X1 != X3
& X2 != X3 ) )
& ( in(X3,X0)
| X1 = X3
| X2 = X3 ) ) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X2,X1] :
( ! [X3] :
( ( X1 = X3
| X2 = X3 )
<=> in(X3,X0) )
<=> unordered_pair(X1,X2) = X0 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X2,X0,X1] :
( ! [X3] :
( ( X0 = X3
| X1 = X3 )
<=> in(X3,X2) )
<=> unordered_pair(X0,X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f76,plain,
! [X0] :
( ~ in(X0,sF7)
| in(sK2,sK3)
| in(X0,sK3) ),
inference(resolution,[],[f49,f62]) ).
fof(f62,plain,
( subset(sF7,sK3)
| in(sK2,sK3) ),
inference(definition_folding,[],[f46,f59]) ).
fof(f46,plain,
( in(sK2,sK3)
| subset(unordered_pair(sK2,sK4),sK3) ),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( ( ~ in(sK4,sK3)
| ~ in(sK2,sK3)
| ~ subset(unordered_pair(sK2,sK4),sK3) )
& ( ( in(sK4,sK3)
& in(sK2,sK3) )
| subset(unordered_pair(sK2,sK4),sK3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f27,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( ( ~ in(X2,X1)
| ~ in(X0,X1)
| ~ subset(unordered_pair(X0,X2),X1) )
& ( ( in(X2,X1)
& in(X0,X1) )
| subset(unordered_pair(X0,X2),X1) ) )
=> ( ( ~ in(sK4,sK3)
| ~ in(sK2,sK3)
| ~ subset(unordered_pair(sK2,sK4),sK3) )
& ( ( in(sK4,sK3)
& in(sK2,sK3) )
| subset(unordered_pair(sK2,sK4),sK3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ( ~ in(X2,X1)
| ~ in(X0,X1)
| ~ subset(unordered_pair(X0,X2),X1) )
& ( ( in(X2,X1)
& in(X0,X1) )
| subset(unordered_pair(X0,X2),X1) ) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
? [X1,X0,X2] :
( ( ~ in(X2,X0)
| ~ in(X1,X0)
| ~ subset(unordered_pair(X1,X2),X0) )
& ( ( in(X2,X0)
& in(X1,X0) )
| subset(unordered_pair(X1,X2),X0) ) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
? [X1,X0,X2] :
( ( ~ in(X2,X0)
| ~ in(X1,X0)
| ~ subset(unordered_pair(X1,X2),X0) )
& ( ( in(X2,X0)
& in(X1,X0) )
| subset(unordered_pair(X1,X2),X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
? [X1,X0,X2] :
( subset(unordered_pair(X1,X2),X0)
<~> ( in(X2,X0)
& in(X1,X0) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
~ ! [X2,X0,X1] :
( subset(unordered_pair(X1,X2),X0)
<=> ( in(X2,X0)
& in(X1,X0) ) ),
inference(rectify,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X0,X2)
& in(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f49,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| in(X3,X1)
| ~ in(X3,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( in(sK5(X0,X1),X0)
& ~ in(sK5(X0,X1),X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f31,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
=> ( in(sK5(X0,X1),X0)
& ~ in(sK5(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f30,plain,
! [X1,X0] :
( ( subset(X1,X0)
| ? [X2] :
( in(X2,X1)
& ~ in(X2,X0) ) )
& ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( in(X2,X1)
=> in(X2,X0) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f94,plain,
( ~ in(sK2,sK3)
| ~ subset(sF7,sK3) ),
inference(resolution,[],[f93,f60]) ).
fof(f60,plain,
( ~ in(sK4,sK3)
| ~ in(sK2,sK3)
| ~ subset(sF7,sK3) ),
inference(definition_folding,[],[f48,f59]) ).
fof(f48,plain,
( ~ in(sK4,sK3)
| ~ in(sK2,sK3)
| ~ subset(unordered_pair(sK2,sK4),sK3) ),
inference(cnf_transformation,[],[f29]) ).
fof(f93,plain,
in(sK4,sK3),
inference(duplicate_literal_removal,[],[f90]) ).
fof(f90,plain,
( in(sK4,sK3)
| in(sK4,sK3) ),
inference(resolution,[],[f77,f63]) ).
fof(f63,plain,
in(sK4,sF7),
inference(superposition,[],[f58,f59]) ).
fof(f58,plain,
! [X2,X3] : in(X3,unordered_pair(X2,X3)),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
! [X2,X3,X0] :
( in(X3,X0)
| unordered_pair(X2,X3) != X0 ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X3,X0,X1] :
( in(X3,X0)
| X1 != X3
| unordered_pair(X2,X1) != X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f77,plain,
! [X1] :
( ~ in(X1,sF7)
| in(X1,sK3)
| in(sK4,sK3) ),
inference(resolution,[],[f49,f61]) ).
fof(f61,plain,
( subset(sF7,sK3)
| in(sK4,sK3) ),
inference(definition_folding,[],[f47,f59]) ).
fof(f47,plain,
( in(sK4,sK3)
| subset(unordered_pair(sK2,sK4),sK3) ),
inference(cnf_transformation,[],[f29]) ).
fof(f144,plain,
subset(sF7,sK3),
inference(subsumption_resolution,[],[f142,f82]) ).
fof(f142,plain,
( ~ in(sK2,sK3)
| subset(sF7,sK3) ),
inference(superposition,[],[f50,f137]) ).
fof(f137,plain,
sK5(sF7,sK3) = sK2,
inference(subsumption_resolution,[],[f136,f96]) ).
fof(f136,plain,
( subset(sF7,sK3)
| sK5(sF7,sK3) = sK2 ),
inference(subsumption_resolution,[],[f133,f93]) ).
fof(f133,plain,
( ~ in(sK4,sK3)
| sK5(sF7,sK3) = sK2
| subset(sF7,sK3) ),
inference(superposition,[],[f50,f127]) ).
fof(f127,plain,
( sK5(sF7,sK3) = sK4
| sK5(sF7,sK3) = sK2 ),
inference(resolution,[],[f121,f96]) ).
fof(f121,plain,
! [X0] :
( subset(sF7,X0)
| sK2 = sK5(sF7,X0)
| sK4 = sK5(sF7,X0) ),
inference(resolution,[],[f87,f51]) ).
fof(f51,plain,
! [X0,X1] :
( in(sK5(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f87,plain,
! [X0] :
( ~ in(X0,sF7)
| sK2 = X0
| sK4 = X0 ),
inference(superposition,[],[f54,f59]) ).
fof(f54,plain,
! [X2,X3,X1] :
( ~ in(X3,unordered_pair(X2,X1))
| X2 = X3
| X1 = X3 ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X3,X0,X1] :
( X2 = X3
| X1 = X3
| ~ in(X3,X0)
| unordered_pair(X2,X1) != X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f50,plain,
! [X0,X1] :
( ~ in(sK5(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU159+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.12/0.34 % Computer : n012.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 14:42:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.55 % (13310)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.55 % (13311)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.56 % (13294)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 % (13303)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.56 % (13305)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.19/0.56 % (13289)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.56 % (13289)Refutation not found, incomplete strategy% (13289)------------------------------
% 0.19/0.56 % (13289)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (13289)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (13289)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.56
% 0.19/0.56 % (13289)Memory used [KB]: 5373
% 0.19/0.56 % (13289)Time elapsed: 0.132 s
% 0.19/0.56 % (13289)Instructions burned: 2 (million)
% 0.19/0.56 % (13289)------------------------------
% 0.19/0.56 % (13289)------------------------------
% 0.19/0.56 % (13302)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.56 TRYING [1]
% 0.19/0.56 TRYING [2]
% 0.19/0.56 TRYING [3]
% 0.19/0.56 % (13303)First to succeed.
% 0.19/0.56 % (13295)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.57 % (13297)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.57 TRYING [4]
% 0.19/0.57 TRYING [1]
% 0.19/0.57 TRYING [2]
% 0.19/0.57 TRYING [3]
% 0.19/0.57 % (13298)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.57 TRYING [4]
% 0.19/0.58 % (13290)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 (2999ds/37Mi)
% 0.19/0.58 % (13295)Also succeeded, but the first one will report.
% 0.19/0.58 % (13312)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.58 % (13288)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.19/0.58 TRYING [1]
% 0.19/0.58 TRYING [2]
% 0.19/0.58 % (13303)Refutation found. Thanks to Tanya!
% 0.19/0.58 % SZS status Theorem for theBenchmark
% 0.19/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.58 % (13303)------------------------------
% 0.19/0.58 % (13303)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.58 % (13303)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.58 % (13303)Termination reason: Refutation
% 0.19/0.58
% 0.19/0.58 % (13303)Memory used [KB]: 1023
% 0.19/0.58 % (13303)Time elapsed: 0.090 s
% 0.19/0.58 % (13303)Instructions burned: 5 (million)
% 0.19/0.58 % (13303)------------------------------
% 0.19/0.58 % (13303)------------------------------
% 0.19/0.58 % (13287)Success in time 0.226 s
%------------------------------------------------------------------------------