TSTP Solution File: SEU120+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU120+2 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.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 : Tue May 21 03:44:51 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 1 unt; 0 def)
% Number of atoms : 216 ( 12 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 278 ( 117 ~; 94 |; 58 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 103 ( 84 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f107,plain,
$false,
inference(avatar_sat_refutation,[],[f67,f72,f73,f88,f97,f106]) ).
fof(f106,plain,
( ~ spl6_1
| spl6_2 ),
inference(avatar_contradiction_clause,[],[f105]) ).
fof(f105,plain,
( $false
| ~ spl6_1
| spl6_2 ),
inference(subsumption_resolution,[],[f104,f90]) ).
fof(f90,plain,
( in(sK0(sK1,sK2),sK1)
| spl6_2 ),
inference(resolution,[],[f65,f33]) ).
fof(f33,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] :
( ~ in(X2,X1)
| ~ in(X2,X0) ) )
& ( ( in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) )
| disjoint(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
=> ( in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] :
( ~ in(X2,X1)
| ~ in(X2,X0) ) )
& ( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X3] :
~ ( in(X3,X1)
& in(X3,X0) )
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f65,plain,
( ~ disjoint(sK1,sK2)
| spl6_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f64,plain,
( spl6_2
<=> disjoint(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).
fof(f104,plain,
( ~ in(sK0(sK1,sK2),sK1)
| ~ spl6_1
| spl6_2 ),
inference(resolution,[],[f95,f89]) ).
fof(f89,plain,
( in(sK0(sK1,sK2),sK2)
| spl6_2 ),
inference(resolution,[],[f65,f34]) ).
fof(f34,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f95,plain,
( ! [X0] :
( ~ in(X0,sK2)
| ~ in(X0,sK1) )
| ~ spl6_1 ),
inference(resolution,[],[f62,f50]) ).
fof(f50,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f30,f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK4(X0,X1,X2),X1)
| ~ in(sK4(X0,X1,X2),X0)
| ~ in(sK4(X0,X1,X2),X2) )
& ( ( in(sK4(X0,X1,X2),X1)
& in(sK4(X0,X1,X2),X0) )
| in(sK4(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f62,plain,
( ! [X3] : ~ in(X3,set_intersection2(sK1,sK2))
| ~ spl6_1 ),
inference(avatar_component_clause,[],[f61]) ).
fof(f61,plain,
( spl6_1
<=> ! [X3] : ~ in(X3,set_intersection2(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).
fof(f97,plain,
( ~ spl6_1
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f96]) ).
fof(f96,plain,
( $false
| ~ spl6_1
| ~ spl6_3 ),
inference(resolution,[],[f62,f71]) ).
fof(f71,plain,
( in(sK3,set_intersection2(sK1,sK2))
| ~ spl6_3 ),
inference(avatar_component_clause,[],[f69]) ).
fof(f69,plain,
( spl6_3
<=> in(sK3,set_intersection2(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl6_3])]) ).
fof(f88,plain,
( ~ spl6_2
| ~ spl6_3 ),
inference(avatar_contradiction_clause,[],[f87]) ).
fof(f87,plain,
( $false
| ~ spl6_2
| ~ spl6_3 ),
inference(subsumption_resolution,[],[f86,f74]) ).
fof(f74,plain,
( in(sK3,sK1)
| ~ spl6_3 ),
inference(resolution,[],[f71,f52]) ).
fof(f52,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f40]) ).
fof(f40,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f86,plain,
( ~ in(sK3,sK1)
| ~ spl6_2
| ~ spl6_3 ),
inference(resolution,[],[f85,f75]) ).
fof(f75,plain,
( in(sK3,sK2)
| ~ spl6_3 ),
inference(resolution,[],[f71,f51]) ).
fof(f51,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f41]) ).
fof(f41,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f85,plain,
( ! [X0] :
( ~ in(X0,sK2)
| ~ in(X0,sK1) )
| ~ spl6_2 ),
inference(resolution,[],[f35,f66]) ).
fof(f66,plain,
( disjoint(sK1,sK2)
| ~ spl6_2 ),
inference(avatar_component_clause,[],[f64]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f73,plain,
( ~ spl6_2
| spl6_3 ),
inference(avatar_split_clause,[],[f36,f69,f64]) ).
fof(f36,plain,
( in(sK3,set_intersection2(sK1,sK2))
| ~ disjoint(sK1,sK2) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
( ( disjoint(sK1,sK2)
& in(sK3,set_intersection2(sK1,sK2)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK1,sK2))
& ~ disjoint(sK1,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f20,f26,f25]) ).
fof(f25,plain,
( ? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) )
=> ( ( disjoint(sK1,sK2)
& ? [X2] : in(X2,set_intersection2(sK1,sK2)) )
| ( ! [X3] : ~ in(X3,set_intersection2(sK1,sK2))
& ~ disjoint(sK1,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
( ? [X2] : in(X2,set_intersection2(sK1,sK2))
=> in(sK3,set_intersection2(sK1,sK2)) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
| ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f14,conjecture,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f72,plain,
( spl6_1
| spl6_3 ),
inference(avatar_split_clause,[],[f37,f69,f61]) ).
fof(f37,plain,
! [X3] :
( in(sK3,set_intersection2(sK1,sK2))
| ~ in(X3,set_intersection2(sK1,sK2)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f67,plain,
( spl6_1
| spl6_2 ),
inference(avatar_split_clause,[],[f39,f64,f61]) ).
fof(f39,plain,
! [X3] :
( disjoint(sK1,sK2)
| ~ in(X3,set_intersection2(sK1,sK2)) ),
inference(cnf_transformation,[],[f27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU120+2 : TPTP v8.2.0. Released v3.3.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 16:35:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.56/0.75 % (14413)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.56/0.75 % (14406)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.75 % (14408)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.75 % (14407)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.56/0.75 % (14410)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.56/0.75 % (14409)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.56/0.75 % (14411)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.56/0.75 % (14412)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.56/0.75 % (14413)First to succeed.
% 0.56/0.75 % (14413)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14405"
% 0.56/0.75 % (14413)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for theBenchmark
% 0.56/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.75 % (14413)------------------------------
% 0.56/0.75 % (14413)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (14413)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (14413)Memory used [KB]: 1065
% 0.56/0.75 % (14413)Time elapsed: 0.003 s
% 0.56/0.75 % (14413)Instructions burned: 5 (million)
% 0.56/0.75 % (14405)Success in time 0.384 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------