TSTP Solution File: SWC275+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC275+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 : n014.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:01:02 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of formulae : 55 ( 10 unt; 0 def)
% Number of atoms : 282 ( 92 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 336 ( 109 ~; 94 |; 109 &)
% ( 9 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 29 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f364,plain,
$false,
inference(avatar_sat_refutation,[],[f277,f282,f291,f310,f315,f344]) ).
fof(f344,plain,
( ~ spl17_3
| ~ spl17_4 ),
inference(avatar_contradiction_clause,[],[f343]) ).
fof(f343,plain,
( $false
| ~ spl17_3
| ~ spl17_4 ),
inference(subsumption_resolution,[],[f342,f281]) ).
fof(f281,plain,
( ssItem(sK4)
| ~ spl17_4 ),
inference(avatar_component_clause,[],[f279]) ).
fof(f279,plain,
( spl17_4
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_4])]) ).
fof(f342,plain,
( ~ ssItem(sK4)
| ~ spl17_3 ),
inference(subsumption_resolution,[],[f341,f202]) ).
fof(f202,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.HvOv7yKbdg/Vampire---4.8_2765',ax17) ).
fof(f341,plain,
( ~ ssList(nil)
| ~ ssItem(sK4)
| ~ spl17_3 ),
inference(subsumption_resolution,[],[f318,f248]) ).
fof(f248,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f182,f181]) ).
fof(f181,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ( ~ neq(sK3,nil)
| ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f98,f143,f142,f141,f140,f139]) ).
fof(f139,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK0)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK0)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK0)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(sK0)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ totalorderedP(sK0)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
( ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ totalorderedP(X0)
& 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] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HvOv7yKbdg/Vampire---4.8_2765',co1) ).
fof(f182,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f144]) ).
fof(f318,plain,
( totalorderedP(sK2)
| ~ ssList(nil)
| ~ ssItem(sK4)
| ~ spl17_3 ),
inference(superposition,[],[f255,f276]) ).
fof(f276,plain,
( sK2 = cons(sK4,nil)
| ~ spl17_3 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f274,plain,
( spl17_3
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_3])]) ).
fof(f255,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f217]) ).
fof(f217,plain,
! [X0,X1] :
( totalorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ( ( totalorderedP(cons(X0,X1))
| ( ( ~ leq(X0,hd(X1))
| ~ totalorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1
| ~ totalorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ! [X1] :
( ( totalorderedP(cons(X0,X1))
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f67]) ).
fof(f67,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( totalorderedP(cons(X0,X1))
<=> ( ( leq(X0,hd(X1))
& totalorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HvOv7yKbdg/Vampire---4.8_2765',ax67) ).
fof(f315,plain,
~ spl17_5,
inference(avatar_contradiction_clause,[],[f314]) ).
fof(f314,plain,
( $false
| ~ spl17_5 ),
inference(subsumption_resolution,[],[f312,f219]) ).
fof(f219,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/tmp/tmp.HvOv7yKbdg/Vampire---4.8_2765',ax66) ).
fof(f312,plain,
( ~ totalorderedP(nil)
| ~ spl17_5 ),
inference(superposition,[],[f248,f286]) ).
fof(f286,plain,
( nil = sK2
| ~ spl17_5 ),
inference(avatar_component_clause,[],[f284]) ).
fof(f284,plain,
( spl17_5
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_5])]) ).
fof(f310,plain,
( spl17_6
| spl17_2 ),
inference(avatar_split_clause,[],[f309,f269,f288]) ).
fof(f288,plain,
( spl17_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl17_6])]) ).
fof(f269,plain,
( spl17_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl17_2])]) ).
fof(f309,plain,
( nil = sK3
| spl17_2 ),
inference(subsumption_resolution,[],[f308,f179]) ).
fof(f179,plain,
ssList(sK3),
inference(cnf_transformation,[],[f144]) ).
fof(f308,plain,
( nil = sK3
| ~ ssList(sK3)
| spl17_2 ),
inference(subsumption_resolution,[],[f293,f202]) ).
fof(f293,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl17_2 ),
inference(resolution,[],[f271,f199]) ).
fof(f199,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f106]) ).
fof(f106,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/sandbox/tmp/tmp.HvOv7yKbdg/Vampire---4.8_2765',ax15) ).
fof(f271,plain,
( ~ neq(sK3,nil)
| spl17_2 ),
inference(avatar_component_clause,[],[f269]) ).
fof(f291,plain,
( spl17_5
| ~ spl17_6 ),
inference(avatar_split_clause,[],[f183,f288,f284]) ).
fof(f183,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f144]) ).
fof(f282,plain,
( spl17_4
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f184,f269,f279]) ).
fof(f184,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f277,plain,
( spl17_3
| ~ spl17_2 ),
inference(avatar_split_clause,[],[f185,f269,f274]) ).
fof(f185,plain,
( ~ neq(sK3,nil)
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC275+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.37 % Computer : n014.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 18:10:18 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.HvOv7yKbdg/Vampire---4.8_2765
% 0.55/0.76 % (3022)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.76 % (3023)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.76 % (3016)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.76 % (3018)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.76 % (3019)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.76 % (3017)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.76 % (3020)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.76 % (3021)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.60/0.76 % (3023)Refutation not found, incomplete strategy% (3023)------------------------------
% 0.60/0.76 % (3023)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (3023)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (3023)Memory used [KB]: 1177
% 0.60/0.76 % (3023)Time elapsed: 0.006 s
% 0.60/0.76 % (3023)Instructions burned: 7 (million)
% 0.60/0.76 % (3023)------------------------------
% 0.60/0.76 % (3023)------------------------------
% 0.60/0.76 % (3021)First to succeed.
% 0.60/0.76 % (3022)Also succeeded, but the first one will report.
% 0.60/0.76 % (3018)Also succeeded, but the first one will report.
% 0.60/0.76 % (3021)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (3021)------------------------------
% 0.60/0.76 % (3021)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (3021)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (3021)Memory used [KB]: 1186
% 0.60/0.76 % (3021)Time elapsed: 0.007 s
% 0.60/0.76 % (3021)Instructions burned: 10 (million)
% 0.60/0.76 % (3021)------------------------------
% 0.60/0.76 % (3021)------------------------------
% 0.60/0.76 % (3012)Success in time 0.38 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------