TSTP Solution File: SET027+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET027+1 : TPTP v8.1.2. Bugfixed v5.4.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 : n026.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:03:03 EDT 2024
% Result : Theorem 0.54s 0.75s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 89 ( 35 ~; 25 |; 21 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 30 ( 30 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 4 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 60 ( 47 !; 12 ?; 22 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_6,type,
sQ4_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f91,plain,
$false,
inference(subsumption_resolution,[],[f87,f59]) ).
tff(f59,plain,
subclass(sK1,sK2),
inference(cnf_transformation,[],[f51]) ).
tff(f51,plain,
( ~ subclass(sK0,sK2)
& subclass(sK1,sK2)
& subclass(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f48,f50]) ).
tff(f50,plain,
( ? [X0,X1,X2] :
( ~ subclass(X0,X2)
& subclass(X1,X2)
& subclass(X0,X1) )
=> ( ~ subclass(sK0,sK2)
& subclass(sK1,sK2)
& subclass(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f48,plain,
? [X0,X1,X2] :
( ~ subclass(X0,X2)
& subclass(X1,X2)
& subclass(X0,X1) ),
inference(flattening,[],[f47]) ).
tff(f47,plain,
? [X0,X1,X2] :
( ~ subclass(X0,X2)
& subclass(X1,X2)
& subclass(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
tff(f46,plain,
~ ! [X0,X1,X2] :
( ( subclass(X1,X2)
& subclass(X0,X1) )
=> subclass(X0,X2) ),
inference(rectify,[],[f45]) ).
tff(f45,negated_conjecture,
~ ! [X0,X1,X4] :
( ( subclass(X1,X4)
& subclass(X0,X1) )
=> subclass(X0,X4) ),
inference(negated_conjecture,[],[f44]) ).
tff(f44,conjecture,
! [X0,X1,X4] :
( ( subclass(X1,X4)
& subclass(X0,X1) )
=> subclass(X0,X4) ),
file('/export/starexec/sandbox/tmp/tmp.23ewHMvbS4/Vampire---4.8_18268',transitivity) ).
tff(f87,plain,
~ subclass(sK1,sK2),
inference(resolution,[],[f83,f58]) ).
tff(f58,plain,
subclass(sK0,sK1),
inference(cnf_transformation,[],[f51]) ).
tff(f83,plain,
! [X0: $i] :
( ~ subclass(sK0,X0)
| ~ subclass(X0,sK2) ),
inference(resolution,[],[f82,f60]) ).
tff(f60,plain,
~ subclass(sK0,sK2),
inference(cnf_transformation,[],[f51]) ).
tff(f82,plain,
! [X2: $i,X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ subclass(X2,X1)
| ~ subclass(X0,X2) ),
inference(duplicate_literal_removal,[],[f80]) ).
tff(f80,plain,
! [X2: $i,X0: $i,X1: $i] :
( subclass(X0,X1)
| ~ subclass(X2,X1)
| ~ subclass(X0,X2)
| subclass(X0,X1) ),
inference(resolution,[],[f78,f66]) ).
tff(f66,plain,
! [X0: $i,X1: $i] :
( member(sK3(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
tff(f57,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f55,f56]) ).
tff(f56,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
tff(f55,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f54]) ).
tff(f54,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f49]) ).
tff(f49,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.23ewHMvbS4/Vampire---4.8_18268',subclass_defn) ).
tff(f78,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( ~ member(sK3(X2,X1),X3)
| subclass(X2,X1)
| ~ subclass(X0,X1)
| ~ subclass(X3,X0) ),
inference(resolution,[],[f76,f65]) ).
tff(f65,plain,
! [X3: $i,X0: $i,X1: $i] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
tff(f76,plain,
! [X2: $i,X0: $i,X1: $i] :
( ~ member(sK3(X0,X1),X2)
| ~ subclass(X2,X1)
| subclass(X0,X1) ),
inference(resolution,[],[f65,f67]) ).
tff(f67,plain,
! [X0: $i,X1: $i] :
( ~ member(sK3(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET027+1 : TPTP v8.1.2. Bugfixed v5.4.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 : n026.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 16:50:23 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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/tmp/tmp.23ewHMvbS4/Vampire---4.8_18268
% 0.54/0.75 % (18530)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.54/0.75 % (18532)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.54/0.75 % (18533)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.54/0.75 % (18535)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.54/0.75 % (18531)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.54/0.75 % (18534)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.54/0.75 % (18536)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.54/0.75 % (18537)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.54/0.75 % (18530)First to succeed.
% 0.54/0.75 % (18537)Refutation not found, incomplete strategy% (18537)------------------------------
% 0.54/0.75 % (18537)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (18537)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (18537)Memory used [KB]: 1038
% 0.54/0.75 % (18537)Time elapsed: 0.003 s
% 0.54/0.75 % (18537)Instructions burned: 2 (million)
% 0.54/0.75 % (18530)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18520"
% 0.54/0.75 % (18535)Refutation not found, incomplete strategy% (18535)------------------------------
% 0.54/0.75 % (18535)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (18535)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75
% 0.54/0.75 % (18535)Memory used [KB]: 1056
% 0.54/0.75 % (18535)Time elapsed: 0.003 s
% 0.54/0.75 % (18535)Instructions burned: 2 (million)
% 0.54/0.75 % (18533)Also succeeded, but the first one will report.
% 0.54/0.75 % (18537)------------------------------
% 0.54/0.75 % (18537)------------------------------
% 0.54/0.75 % (18535)------------------------------
% 0.54/0.75 % (18535)------------------------------
% 0.54/0.75 % (18536)Also succeeded, but the first one will report.
% 0.54/0.75 % (18530)Refutation found. Thanks to Tanya!
% 0.54/0.75 % SZS status Theorem for Vampire---4
% 0.54/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.75 % (18530)------------------------------
% 0.54/0.75 % (18530)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (18530)Termination reason: Refutation
% 0.54/0.75
% 0.54/0.75 % (18530)Memory used [KB]: 1066
% 0.54/0.75 % (18530)Time elapsed: 0.003 s
% 0.54/0.75 % (18530)Instructions burned: 4 (million)
% 0.54/0.75 % (18520)Success in time 0.38 s
% 0.54/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------