TSTP Solution File: SEU280+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU280+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 : Sun May 5 09:31:07 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 10
% Syntax : Number of formulae : 67 ( 3 unt; 0 def)
% Number of atoms : 285 ( 66 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 315 ( 97 ~; 115 |; 84 &)
% ( 9 <=>; 9 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 120 ( 72 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f261,plain,
$false,
inference(avatar_sat_refutation,[],[f62,f251,f260]) ).
fof(f260,plain,
~ spl9_1,
inference(avatar_contradiction_clause,[],[f259]) ).
fof(f259,plain,
( $false
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f258,f253]) ).
fof(f253,plain,
( sK3 = sK4
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f40,f56]) ).
fof(f56,plain,
( sP0
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f55,plain,
( spl9_1
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl9_1])]) ).
fof(f40,plain,
( sK3 = sK4
| ~ sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
( ( sK4 != sK5
& ordinal(sK5)
& sK3 = sK5
& ordinal(sK4)
& sK3 = sK4 )
| ~ sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f24,f25]) ).
fof(f25,plain,
( ? [X0,X1,X2] :
( X1 != X2
& ordinal(X2)
& X0 = X2
& ordinal(X1)
& X0 = X1 )
=> ( sK4 != sK5
& ordinal(sK5)
& sK3 = sK5
& ordinal(sK4)
& sK3 = sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
( ? [X0,X1,X2] :
( X1 != X2
& ordinal(X2)
& X0 = X2
& ordinal(X1)
& X0 = X1 )
| ~ sP0 ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
( ? [X1,X2,X3] :
( X2 != X3
& ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 )
| ~ sP0 ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
( ? [X1,X2,X3] :
( X2 != X3
& ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f258,plain,
( sK3 != sK4
| ~ spl9_1 ),
inference(forward_demodulation,[],[f257,f255]) ).
fof(f255,plain,
( sK3 = sK5
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f42,f56]) ).
fof(f42,plain,
( sK3 = sK5
| ~ sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f257,plain,
( sK4 != sK5
| ~ spl9_1 ),
inference(subsumption_resolution,[],[f44,f56]) ).
fof(f44,plain,
( sK4 != sK5
| ~ sP0 ),
inference(cnf_transformation,[],[f26]) ).
fof(f251,plain,
spl9_1,
inference(avatar_contradiction_clause,[],[f250]) ).
fof(f250,plain,
( $false
| spl9_1 ),
inference(subsumption_resolution,[],[f249,f230]) ).
fof(f230,plain,
( in(sK2(sK6(sK1)),sK1)
| spl9_1 ),
inference(subsumption_resolution,[],[f228,f34]) ).
fof(f34,plain,
! [X1] :
( in(sK2(X1),sK1)
| in(sK2(X1),X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X1] :
( ( ~ ordinal(sK2(X1))
| ~ in(sK2(X1),sK1)
| ~ in(sK2(X1),X1) )
& ( ( ordinal(sK2(X1))
& in(sK2(X1),sK1) )
| in(sK2(X1),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f19,f21,f20]) ).
fof(f20,plain,
( ? [X0] :
! [X1] :
? [X2] :
( ( ~ ordinal(X2)
| ~ in(X2,X0)
| ~ in(X2,X1) )
& ( ( ordinal(X2)
& in(X2,X0) )
| in(X2,X1) ) )
=> ! [X1] :
? [X2] :
( ( ~ ordinal(X2)
| ~ in(X2,sK1)
| ~ in(X2,X1) )
& ( ( ordinal(X2)
& in(X2,sK1) )
| in(X2,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X1] :
( ? [X2] :
( ( ~ ordinal(X2)
| ~ in(X2,sK1)
| ~ in(X2,X1) )
& ( ( ordinal(X2)
& in(X2,sK1) )
| in(X2,X1) ) )
=> ( ( ~ ordinal(sK2(X1))
| ~ in(sK2(X1),sK1)
| ~ in(sK2(X1),X1) )
& ( ( ordinal(sK2(X1))
& in(sK2(X1),sK1) )
| in(sK2(X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
? [X0] :
! [X1] :
? [X2] :
( ( ~ ordinal(X2)
| ~ in(X2,X0)
| ~ in(X2,X1) )
& ( ( ordinal(X2)
& in(X2,X0) )
| in(X2,X1) ) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
? [X0] :
! [X1] :
? [X2] :
( ( ~ ordinal(X2)
| ~ in(X2,X0)
| ~ in(X2,X1) )
& ( ( ordinal(X2)
& in(X2,X0) )
| in(X2,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
? [X0] :
! [X1] :
? [X2] :
( in(X2,X1)
<~> ( ordinal(X2)
& in(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( ordinal(X2)
& in(X2,X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0] :
? [X1] :
! [X2] :
( in(X2,X1)
<=> ( ordinal(X2)
& in(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_xboole_0__e6_22__wellord2) ).
fof(f228,plain,
( in(sK2(sK6(sK1)),sK1)
| ~ in(sK2(sK6(sK1)),sK6(sK1))
| spl9_1 ),
inference(superposition,[],[f81,f223]) ).
fof(f223,plain,
( sK2(sK6(sK1)) = sK7(sK1,sK2(sK6(sK1)))
| spl9_1 ),
inference(trivial_inequality_removal,[],[f222]) ).
fof(f222,plain,
( sK2(sK6(sK1)) != sK2(sK6(sK1))
| sK2(sK6(sK1)) = sK7(sK1,sK2(sK6(sK1)))
| spl9_1 ),
inference(equality_factoring,[],[f106]) ).
fof(f106,plain,
( ! [X0] :
( sK2(sK6(X0)) = sK7(X0,sK2(sK6(X0)))
| sK2(sK6(X0)) = sK7(sK1,sK2(sK6(X0))) )
| spl9_1 ),
inference(subsumption_resolution,[],[f104,f74]) ).
fof(f74,plain,
( ! [X0] : ordinal(sK2(sK6(X0)))
| spl9_1 ),
inference(duplicate_literal_removal,[],[f73]) ).
fof(f73,plain,
( ! [X0] :
( ordinal(sK2(sK6(X0)))
| ordinal(sK2(sK6(X0))) )
| spl9_1 ),
inference(resolution,[],[f70,f35]) ).
fof(f35,plain,
! [X1] :
( in(sK2(X1),X1)
| ordinal(sK2(X1)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f70,plain,
( ! [X2,X0] :
( ~ in(X2,sK6(X0))
| ordinal(X2) )
| spl9_1 ),
inference(subsumption_resolution,[],[f47,f57]) ).
fof(f57,plain,
( ~ sP0
| spl9_1 ),
inference(avatar_component_clause,[],[f55]) ).
fof(f47,plain,
! [X2,X0] :
( ordinal(X2)
| ~ in(X2,sK6(X0))
| sP0 ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0] :
( ! [X2] :
( ( in(X2,sK6(X0))
| ! [X3] :
( ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0) ) )
& ( ( ordinal(X2)
& sK7(X0,X2) = X2
& in(sK7(X0,X2),X0) )
| ~ in(X2,sK6(X0)) ) )
| sP0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f28,f30,f29]) ).
fof(f29,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0) ) )
& ( ? [X4] :
( ordinal(X2)
& X2 = X4
& in(X4,X0) )
| ~ in(X2,X1) ) )
=> ! [X2] :
( ( in(X2,sK6(X0))
| ! [X3] :
( ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0) ) )
& ( ? [X4] :
( ordinal(X2)
& X2 = X4
& in(X4,X0) )
| ~ in(X2,sK6(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X2] :
( ? [X4] :
( ordinal(X2)
& X2 = X4
& in(X4,X0) )
=> ( ordinal(X2)
& sK7(X0,X2) = X2
& in(sK7(X0,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0) ) )
& ( ? [X4] :
( ordinal(X2)
& X2 = X4
& in(X4,X0) )
| ~ in(X2,X1) ) )
| sP0 ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X0] :
( ? [X4] :
! [X5] :
( ( in(X5,X4)
| ! [X6] :
( ~ ordinal(X5)
| X5 != X6
| ~ in(X6,X0) ) )
& ( ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) )
| ~ in(X5,X4) ) )
| sP0 ),
inference(nnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] :
( ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) )
| sP0 ),
inference(definition_folding,[],[f14,f16]) ).
fof(f14,plain,
! [X0] :
( ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) )
| ? [X1,X2,X3] :
( X2 != X3
& ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 ) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
! [X0] :
( ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) )
| ? [X1,X2,X3] :
( X2 != X3
& ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0] :
( ! [X1,X2,X3] :
( ( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 )
=> X2 = X3 )
=> ? [X4] :
! [X5] :
( in(X5,X4)
<=> ? [X6] :
( ordinal(X5)
& X5 = X6
& in(X6,X0) ) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ! [X1,X2,X3] :
( ( ordinal(X3)
& X1 = X3
& ordinal(X2)
& X1 = X2 )
=> X2 = X3 )
=> ? [X1] :
! [X2] :
( in(X2,X1)
<=> ? [X3] :
( ordinal(X2)
& X2 = X3
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_tarski__e6_22__wellord2__1) ).
fof(f104,plain,
( ! [X0] :
( sK2(sK6(X0)) = sK7(X0,sK2(sK6(X0)))
| ~ ordinal(sK2(sK6(X0)))
| sK2(sK6(X0)) = sK7(sK1,sK2(sK6(X0))) )
| spl9_1 ),
inference(resolution,[],[f86,f90]) ).
fof(f90,plain,
( ! [X0,X1] :
( ~ in(X0,X1)
| ~ ordinal(X0)
| sK7(X1,X0) = X0 )
| spl9_1 ),
inference(resolution,[],[f89,f84]) ).
fof(f84,plain,
( ! [X2,X0] :
( ~ in(X2,sK6(X0))
| sK7(X0,X2) = X2 )
| spl9_1 ),
inference(subsumption_resolution,[],[f46,f57]) ).
fof(f46,plain,
! [X2,X0] :
( sK7(X0,X2) = X2
| ~ in(X2,sK6(X0))
| sP0 ),
inference(cnf_transformation,[],[f31]) ).
fof(f89,plain,
( ! [X3,X0] :
( in(X3,sK6(X0))
| ~ ordinal(X3)
| ~ in(X3,X0) )
| spl9_1 ),
inference(subsumption_resolution,[],[f53,f57]) ).
fof(f53,plain,
! [X3,X0] :
( in(X3,sK6(X0))
| ~ ordinal(X3)
| ~ in(X3,X0)
| sP0 ),
inference(equality_resolution,[],[f48]) ).
fof(f48,plain,
! [X2,X3,X0] :
( in(X2,sK6(X0))
| ~ ordinal(X2)
| X2 != X3
| ~ in(X3,X0)
| sP0 ),
inference(cnf_transformation,[],[f31]) ).
fof(f86,plain,
( ! [X0] :
( in(sK2(sK6(X0)),sK1)
| sK2(sK6(X0)) = sK7(X0,sK2(sK6(X0))) )
| spl9_1 ),
inference(resolution,[],[f84,f34]) ).
fof(f81,plain,
( ! [X2,X0] :
( in(sK7(X0,X2),X0)
| ~ in(X2,sK6(X0)) )
| spl9_1 ),
inference(subsumption_resolution,[],[f45,f57]) ).
fof(f45,plain,
! [X2,X0] :
( in(sK7(X0,X2),X0)
| ~ in(X2,sK6(X0))
| sP0 ),
inference(cnf_transformation,[],[f31]) ).
fof(f249,plain,
( ~ in(sK2(sK6(sK1)),sK1)
| spl9_1 ),
inference(subsumption_resolution,[],[f248,f74]) ).
fof(f248,plain,
( ~ ordinal(sK2(sK6(sK1)))
| ~ in(sK2(sK6(sK1)),sK1)
| spl9_1 ),
inference(resolution,[],[f237,f89]) ).
fof(f237,plain,
( ~ in(sK2(sK6(sK1)),sK6(sK1))
| spl9_1 ),
inference(subsumption_resolution,[],[f231,f74]) ).
fof(f231,plain,
( ~ ordinal(sK2(sK6(sK1)))
| ~ in(sK2(sK6(sK1)),sK6(sK1))
| spl9_1 ),
inference(resolution,[],[f230,f36]) ).
fof(f36,plain,
! [X1] :
( ~ in(sK2(X1),sK1)
| ~ ordinal(sK2(X1))
| ~ in(sK2(X1),X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f62,plain,
( ~ spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f41,f59,f55]) ).
fof(f59,plain,
( spl9_2
<=> ordinal(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl9_2])]) ).
fof(f41,plain,
( ordinal(sK4)
| ~ sP0 ),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU280+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.34 % Computer : n016.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Fri May 3 12:09:45 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.21/0.34 % (11960)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.36 % (11968)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.36 % (11967)WARNING: value z3 for option sas not known
% 0.21/0.36 % (11966)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.36 % (11969)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.36 % (11971)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.36 % (11970)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.36 TRYING [1]
% 0.21/0.36 % (11967)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.36 TRYING [2]
% 0.21/0.36 TRYING [3]
% 0.21/0.37 % (11965)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.37 TRYING [4]
% 0.21/0.37 % (11967)First to succeed.
% 0.21/0.37 % (11967)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11960"
% 0.21/0.38 % (11967)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (11967)------------------------------
% 0.21/0.38 % (11967)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38 % (11967)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (11967)Memory used [KB]: 882
% 0.21/0.38 % (11967)Time elapsed: 0.013 s
% 0.21/0.38 % (11967)Instructions burned: 15 (million)
% 0.21/0.38 % (11960)Success in time 0.03 s
%------------------------------------------------------------------------------