TSTP Solution File: SEU140+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU140+2 : TPTP v8.1.2. 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 : n023.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:20:27 EDT 2024
% Result : Theorem 0.49s 0.68s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 111 ( 43 ~; 24 |; 36 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 49 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f318,plain,
$false,
inference(subsumption_resolution,[],[f317,f278]) ).
fof(f278,plain,
in(sK0(sK2,sK4),sK2),
inference(resolution,[],[f140,f152]) ).
fof(f152,plain,
~ disjoint(sK2,sK4),
inference(cnf_transformation,[],[f96]) ).
fof(f96,plain,
( ~ disjoint(sK2,sK4)
& disjoint(sK3,sK4)
& subset(sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f79,f95]) ).
fof(f95,plain,
( ? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& disjoint(X1,X2)
& subset(X0,X1) )
=> ( ~ disjoint(sK2,sK4)
& disjoint(sK3,sK4)
& subset(sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f79,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& disjoint(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f78]) ).
fof(f78,plain,
? [X0,X1,X2] :
( ~ disjoint(X0,X2)
& disjoint(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f52]) ).
fof(f52,negated_conjecture,
~ ! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
inference(negated_conjecture,[],[f51]) ).
fof(f51,conjecture,
! [X0,X1,X2] :
( ( disjoint(X1,X2)
& subset(X0,X1) )
=> disjoint(X0,X2) ),
file('/export/starexec/sandbox/tmp/tmp.HWPVLj3lqb/Vampire---4.8_5754',t63_xboole_1) ).
fof(f140,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f92]) ).
fof(f92,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])],[f73,f91]) ).
fof(f91,plain,
! [X0,X1] :
( ? [X3] :
( in(X3,X1)
& in(X3,X0) )
=> ( in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f73,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,[],[f58]) ).
fof(f58,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,[],[f43]) ).
fof(f43,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/tmp/tmp.HWPVLj3lqb/Vampire---4.8_5754',t3_xboole_0) ).
fof(f317,plain,
~ in(sK0(sK2,sK4),sK2),
inference(resolution,[],[f315,f264]) ).
fof(f264,plain,
! [X0] :
( in(X0,sK3)
| ~ in(X0,sK2) ),
inference(resolution,[],[f150,f181]) ).
fof(f181,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f113,f114]) ).
fof(f114,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK8(X0,X1),X1)
& in(sK8(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f112]) ).
fof(f112,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.HWPVLj3lqb/Vampire---4.8_5754',d3_tarski) ).
fof(f150,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f96]) ).
fof(f315,plain,
~ in(sK0(sK2,sK4),sK3),
inference(resolution,[],[f308,f283]) ).
fof(f283,plain,
in(sK0(sK2,sK4),sK4),
inference(resolution,[],[f141,f152]) ).
fof(f141,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f308,plain,
! [X0] :
( ~ in(X0,sK4)
| ~ in(X0,sK3) ),
inference(resolution,[],[f142,f151]) ).
fof(f151,plain,
disjoint(sK3,sK4),
inference(cnf_transformation,[],[f96]) ).
fof(f142,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,X1)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU140+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % 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.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 11:57:53 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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/tmp/tmp.HWPVLj3lqb/Vampire---4.8_5754
% 0.49/0.68 % (5946)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.49/0.68 % (5939)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 Vampire---4 for (2996ds/34Mi)
% 0.49/0.68 % (5941)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.49/0.68 % (5942)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.49/0.68 % (5940)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 Vampire---4 for (2996ds/51Mi)
% 0.49/0.68 % (5944)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.49/0.68 % (5943)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 Vampire---4 for (2996ds/34Mi)
% 0.49/0.68 % (5945)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 Vampire---4 for (2996ds/83Mi)
% 0.49/0.68 % (5946)First to succeed.
% 0.49/0.68 % (5946)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5938"
% 0.49/0.68 % (5946)Refutation found. Thanks to Tanya!
% 0.49/0.68 % SZS status Theorem for Vampire---4
% 0.49/0.68 % SZS output start Proof for Vampire---4
% See solution above
% 0.49/0.68 % (5946)------------------------------
% 0.49/0.68 % (5946)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.68 % (5946)Termination reason: Refutation
% 0.49/0.68
% 0.49/0.68 % (5946)Memory used [KB]: 1148
% 0.49/0.68 % (5946)Time elapsed: 0.003 s
% 0.49/0.68 % (5946)Instructions burned: 8 (million)
% 0.49/0.68 % (5938)Success in time 0.307 s
% 0.49/0.68 % Vampire---4.8 exiting
%------------------------------------------------------------------------------