TSTP Solution File: SWC408+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC408+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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:54 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 180 ( 42 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 204 ( 54 ~; 35 |; 95 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 25 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f208,plain,
$false,
inference(subsumption_resolution,[],[f207,f152]) ).
fof(f152,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
( ~ memberP(sK0,sK4)
& memberP(sK1,sK4)
& ssItem(sK4)
& sK0 = sK2
& sK1 = sK3
& sK2 = app(sK3,sK3)
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f126,f125,f124,f123,f122]) ).
fof(f122,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& sK0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& sK0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(sK1,X4)
& ssItem(X4) )
& sK0 = X2
& sK1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(sK1,X4)
& ssItem(X4) )
& sK0 = X2
& sK1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(sK1,X4)
& ssItem(X4) )
& sK0 = sK2
& sK1 = X3
& app(X3,X3) = sK2
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X3] :
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(sK1,X4)
& ssItem(X4) )
& sK0 = sK2
& sK1 = X3
& app(X3,X3) = sK2
& ssList(X3) )
=> ( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(sK1,X4)
& ssItem(X4) )
& sK0 = sK2
& sK1 = sK3
& sK2 = app(sK3,sK3)
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X4] :
( ~ memberP(sK0,X4)
& memberP(sK1,X4)
& ssItem(X4) )
=> ( ~ memberP(sK0,sK4)
& memberP(sK1,sK4)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ~ memberP(X0,X4)
& memberP(X1,X4)
& ssItem(X4) )
& X0 = X2
& X1 = X3
& app(X3,X3) = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X0,X4)
| ~ memberP(X1,X4) ) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ( memberP(X0,X4)
| ~ memberP(X1,X4) ) )
| X0 != X2
| X1 != X3
| app(X3,X3) != X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.haPKVexW5B/Vampire---4.8_3238',co1) ).
fof(f207,plain,
~ ssItem(sK4),
inference(subsumption_resolution,[],[f206,f148]) ).
fof(f148,plain,
ssList(sK3),
inference(cnf_transformation,[],[f127]) ).
fof(f206,plain,
( ~ ssList(sK3)
| ~ ssItem(sK4) ),
inference(subsumption_resolution,[],[f205,f190]) ).
fof(f190,plain,
memberP(sK3,sK4),
inference(definition_unfolding,[],[f153,f150]) ).
fof(f150,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f127]) ).
fof(f153,plain,
memberP(sK1,sK4),
inference(cnf_transformation,[],[f127]) ).
fof(f205,plain,
( ~ memberP(sK3,sK4)
| ~ ssList(sK3)
| ~ ssItem(sK4) ),
inference(duplicate_literal_removal,[],[f202]) ).
fof(f202,plain,
( ~ memberP(sK3,sK4)
| ~ ssList(sK3)
| ~ ssList(sK3)
| ~ ssItem(sK4) ),
inference(resolution,[],[f201,f174]) ).
fof(f174,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.haPKVexW5B/Vampire---4.8_3238',ax36) ).
fof(f201,plain,
~ memberP(app(sK3,sK3),sK4),
inference(superposition,[],[f189,f149]) ).
fof(f149,plain,
sK2 = app(sK3,sK3),
inference(cnf_transformation,[],[f127]) ).
fof(f189,plain,
~ memberP(sK2,sK4),
inference(definition_unfolding,[],[f154,f151]) ).
fof(f151,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f127]) ).
fof(f154,plain,
~ memberP(sK0,sK4),
inference(cnf_transformation,[],[f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC408+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/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.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 20:32:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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.haPKVexW5B/Vampire---4.8_3238
% 0.58/0.74 % (3353)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.58/0.74 % (3346)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.58/0.74 % (3348)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.58/0.74 % (3347)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.58/0.74 % (3350)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.58/0.74 % (3349)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.58/0.74 % (3351)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.58/0.74 % (3352)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.58/0.74 % (3353)Refutation not found, incomplete strategy% (3353)------------------------------
% 0.58/0.74 % (3353)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74 % (3353)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.74
% 0.58/0.74 % (3353)Memory used [KB]: 1131
% 0.58/0.74 % (3353)Time elapsed: 0.002 s
% 0.58/0.74 % (3353)Instructions burned: 4 (million)
% 0.58/0.74 % (3353)------------------------------
% 0.58/0.74 % (3353)------------------------------
% 0.58/0.75 % (3351)First to succeed.
% 0.58/0.75 % (3354)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.58/0.75 % (3351)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3345"
% 0.58/0.75 % (3351)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (3351)------------------------------
% 0.58/0.75 % (3351)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (3351)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (3351)Memory used [KB]: 1149
% 0.58/0.75 % (3351)Time elapsed: 0.005 s
% 0.58/0.75 % (3351)Instructions burned: 6 (million)
% 0.58/0.75 % (3345)Success in time 0.388 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------