TSTP Solution File: SWC210+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC210+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 : 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 : Wed May 1 04:00:37 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 193 ( 34 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 212 ( 58 ~; 45 |; 90 &)
% ( 5 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f179,plain,
$false,
inference(avatar_sat_refutation,[],[f156,f161,f164,f178]) ).
fof(f178,plain,
( spl5_1
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f177]) ).
fof(f177,plain,
( $false
| spl5_1
| ~ spl5_3 ),
inference(subsumption_resolution,[],[f175,f131]) ).
fof(f131,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/tmp/tmp.2mAZLdg5bP/Vampire---4.8_21675',ax39) ).
fof(f175,plain,
( singletonP(nil)
| spl5_1
| ~ spl5_3 ),
inference(backward_demodulation,[],[f160,f170]) ).
fof(f170,plain,
( nil = sK2
| spl5_1 ),
inference(unit_resulting_resolution,[],[f116,f130,f151,f127]) ).
fof(f127,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2mAZLdg5bP/Vampire---4.8_21675',ax15) ).
fof(f151,plain,
( ~ neq(sK2,nil)
| spl5_1 ),
inference(avatar_component_clause,[],[f149]) ).
fof(f149,plain,
( spl5_1
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f130,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.2mAZLdg5bP/Vampire---4.8_21675',ax17) ).
fof(f116,plain,
ssList(sK2),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(sK2)
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f106,f105,f104,f103]) ).
fof(f103,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(X0,nil)
& singletonP(X2)
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(X2)
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f104,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(X2)
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(X2)
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(X2)
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(sK2)
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f106,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(sK2)
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& singletonP(sK2)
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(X0,nil)
& singletonP(X2)
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ neq(X0,nil)
& singletonP(X2)
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( neq(X0,nil)
| ~ singletonP(X2)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( neq(X0,nil)
| ~ singletonP(X2)
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2mAZLdg5bP/Vampire---4.8_21675',co1) ).
fof(f160,plain,
( singletonP(sK2)
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f158,plain,
( spl5_3
<=> singletonP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f164,plain,
spl5_2,
inference(avatar_split_clause,[],[f147,f153]) ).
fof(f153,plain,
( spl5_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f147,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f139]) ).
fof(f139,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f120,f118,f118]) ).
fof(f118,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f107]) ).
fof(f120,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f107]) ).
fof(f161,plain,
( spl5_3
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f124,f153,f158]) ).
fof(f124,plain,
( ~ neq(sK3,nil)
| singletonP(sK2) ),
inference(cnf_transformation,[],[f107]) ).
fof(f156,plain,
( ~ spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f135,f153,f149]) ).
fof(f135,plain,
( ~ neq(sK3,nil)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f125,f119]) ).
fof(f119,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f107]) ).
fof(f125,plain,
( ~ neq(sK3,nil)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC210+1 : TPTP v8.1.2. Released v2.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n005.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 : Tue Apr 30 18:16:56 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.2mAZLdg5bP/Vampire---4.8_21675
% 0.55/0.75 % (21871)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.55/0.75 % (21878)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.55/0.75 % (21873)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.55/0.75 % (21875)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.55/0.75 % (21872)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.55/0.75 % (21874)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.55/0.75 % (21876)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.55/0.75 % (21878)Refutation not found, incomplete strategy% (21878)------------------------------
% 0.55/0.75 % (21878)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (21878)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (21878)Memory used [KB]: 1128
% 0.55/0.75 % (21878)Time elapsed: 0.002 s
% 0.55/0.75 % (21878)Instructions burned: 3 (million)
% 0.55/0.75 % (21878)------------------------------
% 0.55/0.75 % (21878)------------------------------
% 0.55/0.75 % (21877)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.55/0.75 % (21874)First to succeed.
% 0.55/0.76 % (21879)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.55/0.76 % (21876)Also succeeded, but the first one will report.
% 0.55/0.76 % (21873)Also succeeded, but the first one will report.
% 0.55/0.76 % (21874)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.76 % (21874)------------------------------
% 0.55/0.76 % (21874)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (21874)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (21874)Memory used [KB]: 1151
% 0.55/0.76 % (21874)Time elapsed: 0.005 s
% 0.55/0.76 % (21874)Instructions burned: 4 (million)
% 0.55/0.76 % (21874)------------------------------
% 0.55/0.76 % (21874)------------------------------
% 0.55/0.76 % (21860)Success in time 0.383 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------