TSTP Solution File: SWC365+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC365+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 : n028.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:37 EDT 2024
% Result : Theorem 0.62s 0.77s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 9 unt; 1 typ; 0 def)
% Number of atoms : 325 ( 54 equ)
% Maximal formula atoms : 26 ( 14 avg)
% Number of connectives : 203 ( 51 ~; 36 |; 102 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 151 ( 151 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 33 ( 8 !; 24 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ9_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f278,plain,
$false,
inference(avatar_sat_refutation,[],[f246,f261,f262]) ).
tff(f262,plain,
spl10_1,
inference(avatar_split_clause,[],[f199,f239]) ).
tff(f239,plain,
( spl10_1
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
tff(f199,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f156,f154]) ).
tff(f154,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
tff(f134,plain,
( ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ~ neq(sK3,nil) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ~ rearsegP(sK1,sK0)
& 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,f133,f132,f131,f130]) ).
tff(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(X1,X0)
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(X1,sK0)
& neq(X1,nil)
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(X1,sK0)
& neq(X1,nil)
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(sK1,sK0)
& neq(sK1,nil)
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f132,plain,
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(sK1,sK0)
& neq(sK1,nil)
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( rearsegP(X3,sK2)
& neq(sK2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ~ rearsegP(sK1,sK0)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f133,plain,
( ? [X3] :
( ( ( rearsegP(X3,sK2)
& neq(sK2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ~ rearsegP(sK1,sK0)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ( ( rearsegP(sK3,sK2)
& neq(sK2,nil) )
| ~ neq(sK3,nil) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ~ rearsegP(sK1,sK0)
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(X1,X0)
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
tff(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ~ rearsegP(X1,X0)
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| rearsegP(X1,X0)
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| rearsegP(X1,X0)
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.F3kc4k3oup/Vampire---4.8_12349',co1) ).
tff(f156,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f134]) ).
tff(f261,plain,
~ spl10_2,
inference(avatar_split_clause,[],[f198,f243]) ).
tff(f243,plain,
( spl10_2
<=> rearsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
tff(f198,plain,
~ rearsegP(sK3,sK2),
inference(definition_unfolding,[],[f157,f154,f155]) ).
tff(f155,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
tff(f157,plain,
~ rearsegP(sK1,sK0),
inference(cnf_transformation,[],[f134]) ).
tff(f246,plain,
( ~ spl10_1
| spl10_2 ),
inference(avatar_split_clause,[],[f160,f243,f239]) ).
tff(f160,plain,
( rearsegP(sK3,sK2)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC365+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % 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.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 20:33:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 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.F3kc4k3oup/Vampire---4.8_12349
% 0.62/0.77 % (12535)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 (2995ds/34Mi)
% 0.62/0.77 % (12542)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 (2995ds/56Mi)
% 0.62/0.77 % (12536)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 (2995ds/51Mi)
% 0.62/0.77 % (12538)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.77 % (12537)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.77 % (12535)First to succeed.
% 0.62/0.77 % (12542)Also succeeded, but the first one will report.
% 0.62/0.77 % (12539)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 (2995ds/34Mi)
% 0.62/0.77 % (12540)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.77 % (12541)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 (2995ds/83Mi)
% 0.62/0.77 % (12535)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12513"
% 0.62/0.77 vampire: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.
% 0.62/0.77 12539 Aborted by signal SIGABRT on /export/starexec/sandbox2/tmp/tmp.F3kc4k3oup/Vampire---4.8_12349
% 0.62/0.77 % (12539)------------------------------
% 0.62/0.77 % (12539)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.77 % (12539)Termination reason: Unknown
% 0.62/0.77 % (12539)Termination phase: Preprocessing 2
% 0.62/0.77
% 0.62/0.77 % (12539)Memory used [KB]: 1070
% 0.62/0.77 % (12539)Time elapsed: 0.002 s
% 0.62/0.77 % (12539)Instructions burned: 3 (million)
% 0.62/0.77 % (12535)Refutation found. Thanks to Tanya!
% 0.62/0.77 % SZS status Theorem for Vampire---4
% 0.62/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.77 % (12535)------------------------------
% 0.62/0.77 % (12535)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.77 % (12535)Termination reason: Refutation
% 0.62/0.77
% 0.62/0.77 % (12535)Memory used [KB]: 1140
% 0.62/0.77 % (12535)Time elapsed: 0.003 s
% 0.62/0.77 % (12535)Instructions burned: 6 (million)
% 0.62/0.77 % (12513)Success in time 0.413 s
% 0.62/0.77 % (12539)------------------------------
% 0.62/0.77 % (12539)------------------------------
% 0.62/0.77 Version : Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 ???
% 0.62/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------