TSTP Solution File: SWC405+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC405+1 : TPTP v8.1.2. Released v2.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n032.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:50:53 EDT 2024
% Result : Theorem 0.46s 0.64s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 9 unt; 1 typ; 0 def)
% Number of atoms : 287 ( 30 equ)
% Maximal formula atoms : 28 ( 13 avg)
% Number of connectives : 252 ( 70 ~; 51 |; 111 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 83 ( 83 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 66 ( 27 !; 38 ?; 2 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ11_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f236,plain,
$false,
inference(subsumption_resolution,[],[f235,f154]) ).
tff(f154,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f128]) ).
tff(f128,plain,
( ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4)
& ! [X5] :
( ( ( ~ memberP(sK3,X5)
| memberP(sK2,X5) )
& ( ~ memberP(sK2,X5)
| memberP(sK3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f127,f126,f125,f124,f123]) ).
tff(f123,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f124,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f125,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(sK2,X5) )
& ( ~ memberP(sK2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f126,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(sK2,X5) )
& ( ~ memberP(sK2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(sK3,X5)
| memberP(sK2,X5) )
& ( ~ memberP(sK2,X5)
| memberP(sK3,X5) ) )
| ~ ssItem(X5) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f127,plain,
( ? [X4] :
( ~ memberP(sK1,X4)
& memberP(sK0,X4)
& ssItem(X4) )
=> ( ~ memberP(sK1,sK4)
& memberP(sK0,sK4)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ! [X5] :
( ( ( ~ memberP(X3,X5)
| memberP(X2,X5) )
& ( ~ memberP(X2,X5)
| memberP(X3,X5) ) )
| ~ ssItem(X5) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
tff(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X1,X4)
| ~ memberP(X0,X4) ) )
| ? [X5] :
( ( ( memberP(X3,X5)
& ~ memberP(X2,X5) )
| ( memberP(X2,X5)
& ~ memberP(X3,X5) ) )
& ssItem(X5) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X5] :
( ssItem(X5)
=> ( memberP(X1,X5)
| ~ memberP(X0,X5) ) )
| ? [X4] :
( ( ( memberP(X3,X4)
& ~ memberP(X2,X4) )
| ( memberP(X2,X4)
& ~ memberP(X3,X4) ) )
& ssItem(X4) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.W4yC3G5tFe/Vampire---4.8_690',co1) ).
tff(f235,plain,
~ ssItem(sK4),
inference(subsumption_resolution,[],[f234,f192]) ).
tff(f192,plain,
memberP(sK2,sK4),
inference(definition_unfolding,[],[f155,f151]) ).
tff(f151,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f128]) ).
tff(f155,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f128]) ).
tff(f234,plain,
( ~ memberP(sK2,sK4)
| ~ ssItem(sK4) ),
inference(resolution,[],[f152,f191]) ).
tff(f191,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f156,f150]) ).
tff(f150,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f128]) ).
tff(f156,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f128]) ).
tff(f152,plain,
! [X5: $i] :
( memberP(sK3,X5)
| ~ memberP(sK2,X5)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC405+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.09 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Fri May 3 20:29:37 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.28 This is a FOF_THM_RFO_SEQ problem
% 0.08/0.28 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.W4yC3G5tFe/Vampire---4.8_690
% 0.46/0.63 % (881)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.46/0.63 % (883)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.46/0.63 % (885)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.46/0.63 % (887)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.46/0.63 % (888)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.46/0.63 % (884)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.46/0.63 % (882)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.46/0.63 % (886)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.46/0.63 % (881)First to succeed.
% 0.46/0.63 % (881)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-880"
% 0.46/0.63 % (884)Also succeeded, but the first one will report.
% 0.46/0.63 % (888)Also succeeded, but the first one will report.
% 0.46/0.64 % (881)Refutation found. Thanks to Tanya!
% 0.46/0.64 % SZS status Theorem for Vampire---4
% 0.46/0.64 % SZS output start Proof for Vampire---4
% See solution above
% 0.46/0.64 % (881)------------------------------
% 0.46/0.64 % (881)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.64 % (881)Termination reason: Refutation
% 0.46/0.64
% 0.46/0.64 % (881)Memory used [KB]: 1139
% 0.46/0.64 % (881)Time elapsed: 0.003 s
% 0.46/0.64 % (881)Instructions burned: 6 (million)
% 0.46/0.64 % (880)Success in time 0.353 s
% 0.46/0.64 % Vampire---4.8 exiting
%------------------------------------------------------------------------------