TSTP Solution File: SEU114+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SEU114+1 : 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 : n020.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:31:58 EDT 2022
% Result : Theorem 0.20s 0.58s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 67 ( 14 unt; 0 def)
% Number of atoms : 240 ( 32 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 277 ( 104 ~; 101 |; 50 &)
% ( 12 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 113 ( 104 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f594,plain,
$false,
inference(subsumption_resolution,[],[f593,f327]) ).
fof(f327,plain,
~ subset(sF14,sF13),
inference(subsumption_resolution,[],[f326,f197]) ).
fof(f197,plain,
sF13 != sF14,
inference(definition_folding,[],[f132,f196,f195]) ).
fof(f195,plain,
sF13 = finite_subsets(sK0),
introduced(function_definition,[]) ).
fof(f196,plain,
powerset(sK0) = sF14,
introduced(function_definition,[]) ).
fof(f132,plain,
finite_subsets(sK0) != powerset(sK0),
inference(cnf_transformation,[],[f82]) ).
fof(f82,plain,
( finite_subsets(sK0) != powerset(sK0)
& finite(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f74,f81]) ).
fof(f81,plain,
( ? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) )
=> ( finite_subsets(sK0) != powerset(sK0)
& finite(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f74,plain,
? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( finite(X0)
=> powerset(X0) = finite_subsets(X0) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X0] :
( finite(X0)
=> powerset(X0) = finite_subsets(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_finsub_1) ).
fof(f326,plain,
( sF13 = sF14
| ~ subset(sF14,sF13) ),
inference(resolution,[],[f186,f223]) ).
fof(f223,plain,
subset(sF13,sF14),
inference(forward_demodulation,[],[f222,f195]) ).
fof(f222,plain,
subset(finite_subsets(sK0),sF14),
inference(superposition,[],[f162,f196]) ).
fof(f162,plain,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_finsub_1) ).
fof(f186,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1] :
( ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f122]) ).
fof(f122,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(flattening,[],[f121]) ).
fof(f121,plain,
! [X1,X0] :
( ( ( subset(X0,X1)
& subset(X1,X0) )
| X0 != X1 )
& ( X0 = X1
| ~ subset(X0,X1)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> X0 = X1 ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f593,plain,
subset(sF14,sF13),
inference(duplicate_literal_removal,[],[f587]) ).
fof(f587,plain,
( subset(sF14,sF13)
| subset(sF14,sF13) ),
inference(resolution,[],[f415,f144]) ).
fof(f144,plain,
! [X0,X1] :
( ~ in(sK4(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f95,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( in(sK4(X0,X1),X1)
& ~ in(sK4(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f93,f94]) ).
fof(f94,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X1)
& ~ in(X3,X0) )
=> ( in(sK4(X0,X1),X1)
& ~ in(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f93,plain,
! [X0,X1] :
( ( ! [X2] :
( ~ in(X2,X1)
| in(X2,X0) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( in(X3,X1)
& ~ in(X3,X0) ) ) ),
inference(rectify,[],[f92]) ).
fof(f92,plain,
! [X1,X0] :
( ( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) ) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X1,X0] :
( ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f415,plain,
! [X0] :
( in(sK4(X0,sF14),sF13)
| subset(sF14,X0) ),
inference(resolution,[],[f386,f145]) ).
fof(f145,plain,
! [X0,X1] :
( in(sK4(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f95]) ).
fof(f386,plain,
! [X0] :
( ~ in(X0,sF14)
| in(X0,sF13) ),
inference(resolution,[],[f353,f179]) ).
fof(f179,plain,
! [X0,X1] :
( element(X1,X0)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0,X1] :
( ~ in(X1,X0)
| element(X1,X0) ),
inference(rectify,[],[f78]) ).
fof(f78,plain,
! [X1,X0] :
( ~ in(X0,X1)
| element(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X1,X0] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(f353,plain,
! [X0] :
( ~ element(X0,sF14)
| in(X0,sF13) ),
inference(resolution,[],[f334,f244]) ).
fof(f244,plain,
! [X0] :
( subset(X0,sK0)
| ~ element(X0,sF14) ),
inference(superposition,[],[f163,f196]) ).
fof(f163,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(rectify,[],[f106]) ).
fof(f106,plain,
! [X1,X0] :
( ( element(X1,powerset(X0))
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ~ element(X1,powerset(X0)) ) ),
inference(nnf_transformation,[],[f38]) ).
fof(f38,plain,
! [X1,X0] :
( element(X1,powerset(X0))
<=> subset(X1,X0) ),
inference(rectify,[],[f32]) ).
fof(f32,axiom,
! [X1,X0] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f334,plain,
! [X0] :
( ~ subset(X0,sK0)
| in(X0,sF13) ),
inference(subsumption_resolution,[],[f333,f254]) ).
fof(f254,plain,
! [X3] :
( ~ subset(X3,sK0)
| finite(X3) ),
inference(resolution,[],[f184,f131]) ).
fof(f131,plain,
finite(sK0),
inference(cnf_transformation,[],[f82]) ).
fof(f184,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ subset(X1,X0)
| finite(X1) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ finite(X0)
| finite(X1) ),
inference(rectify,[],[f76]) ).
fof(f76,plain,
! [X1,X0] :
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(flattening,[],[f75]) ).
fof(f75,plain,
! [X1,X0] :
( finite(X0)
| ~ subset(X0,X1)
| ~ finite(X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X1,X0] :
( ( subset(X0,X1)
& finite(X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f333,plain,
! [X0] :
( ~ finite(X0)
| in(X0,sF13)
| ~ subset(X0,sK0) ),
inference(superposition,[],[f198,f195]) ).
fof(f198,plain,
! [X2,X0] :
( in(X2,finite_subsets(X0))
| ~ finite(X2)
| ~ subset(X2,X0) ),
inference(subsumption_resolution,[],[f190,f154]) ).
fof(f154,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f190,plain,
! [X2,X0] :
( in(X2,finite_subsets(X0))
| ~ subset(X2,X0)
| ~ finite(X2)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f142]) ).
fof(f142,plain,
! [X2,X0,X1] :
( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 )
& ( finite_subsets(X0) = X1
| ( ( ~ subset(sK3(X0,X1),X0)
| ~ finite(sK3(X0,X1))
| ~ in(sK3(X0,X1),X1) )
& ( ( subset(sK3(X0,X1),X0)
& finite(sK3(X0,X1)) )
| in(sK3(X0,X1),X1) ) ) ) )
| ~ preboolean(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f89,f90]) ).
fof(f90,plain,
! [X0,X1] :
( ? [X3] :
( ( ~ subset(X3,X0)
| ~ finite(X3)
| ~ in(X3,X1) )
& ( ( subset(X3,X0)
& finite(X3) )
| in(X3,X1) ) )
=> ( ( ~ subset(sK3(X0,X1),X0)
| ~ finite(sK3(X0,X1))
| ~ in(sK3(X0,X1),X1) )
& ( ( subset(sK3(X0,X1),X0)
& finite(sK3(X0,X1)) )
| in(sK3(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
! [X0,X1] :
( ( ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0)
| ~ finite(X2) )
& ( ( subset(X2,X0)
& finite(X2) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 )
& ( finite_subsets(X0) = X1
| ? [X3] :
( ( ~ subset(X3,X0)
| ~ finite(X3)
| ~ in(X3,X1) )
& ( ( subset(X3,X0)
& finite(X3) )
| in(X3,X1) ) ) ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
! [X1,X0] :
( ( ( ! [X2] :
( ( in(X2,X0)
| ~ subset(X2,X1)
| ~ finite(X2) )
& ( ( subset(X2,X1)
& finite(X2) )
| ~ in(X2,X0) ) )
| finite_subsets(X1) != X0 )
& ( finite_subsets(X1) = X0
| ? [X2] :
( ( ~ subset(X2,X1)
| ~ finite(X2)
| ~ in(X2,X0) )
& ( ( subset(X2,X1)
& finite(X2) )
| in(X2,X0) ) ) ) )
| ~ preboolean(X0) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
! [X1,X0] :
( ( ( ! [X2] :
( ( in(X2,X0)
| ~ subset(X2,X1)
| ~ finite(X2) )
& ( ( subset(X2,X1)
& finite(X2) )
| ~ in(X2,X0) ) )
| finite_subsets(X1) != X0 )
& ( finite_subsets(X1) = X0
| ? [X2] :
( ( ~ subset(X2,X1)
| ~ finite(X2)
| ~ in(X2,X0) )
& ( ( subset(X2,X1)
& finite(X2) )
| in(X2,X0) ) ) ) )
| ~ preboolean(X0) ),
inference(nnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X1,X0] :
( ( ! [X2] :
( in(X2,X0)
<=> ( subset(X2,X1)
& finite(X2) ) )
<=> finite_subsets(X1) = X0 )
| ~ preboolean(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( preboolean(X0)
=> ( ! [X2] :
( in(X2,X0)
<=> ( subset(X2,X1)
& finite(X2) ) )
<=> finite_subsets(X1) = X0 ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X1,X0] :
( preboolean(X1)
=> ( ! [X2] :
( in(X2,X1)
<=> ( subset(X2,X0)
& finite(X2) ) )
<=> finite_subsets(X0) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU114+1 : 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.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 14:41:15 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (19197)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.54 % (19189)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 % (19180)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 % (19172)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (19173)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.56 % (19174)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 (2999ds/48Mi)
% 0.20/0.56 % (19183)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.20/0.56 % (19175)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.20/0.57 % (19190)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.57 % (19192)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.20/0.57 % (19182)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.57 % (19193)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.20/0.57 TRYING [1]
% 0.20/0.57 TRYING [2]
% 0.20/0.57 TRYING [3]
% 0.20/0.57 % (19181)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.58 TRYING [4]
% 0.20/0.58 % (19191)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.58 % (19186)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.20/0.58 % (19199)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.58 % (19197)First to succeed.
% 0.20/0.58 % (19176)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.58 % (19197)Refutation found. Thanks to Tanya!
% 0.20/0.58 % SZS status Theorem for theBenchmark
% 0.20/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.59 % (19197)------------------------------
% 0.20/0.59 % (19197)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59 % (19197)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59 % (19197)Termination reason: Refutation
% 0.20/0.59
% 0.20/0.59 % (19197)Memory used [KB]: 1279
% 0.20/0.59 % (19197)Time elapsed: 0.185 s
% 0.20/0.59 % (19197)Instructions burned: 16 (million)
% 0.20/0.59 % (19197)------------------------------
% 0.20/0.59 % (19197)------------------------------
% 0.20/0.59 % (19168)Success in time 0.22 s
%------------------------------------------------------------------------------