TSTP Solution File: SWC362+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC362+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 : n023.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:35 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 285 ( 28 equ)
% Maximal formula atoms : 22 ( 12 avg)
% Number of connectives : 172 ( 41 ~; 28 |; 89 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 131 ( 131 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,
sQ10_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f272,plain,
$false,
inference(avatar_sat_refutation,[],[f252,f253,f256]) ).
tff(f256,plain,
spl11_2,
inference(avatar_split_clause,[],[f243,f249]) ).
tff(f249,plain,
( spl11_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
tff(f243,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f205]) ).
tff(f205,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f157,f155,f155]) ).
tff(f155,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
tff(f134,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& segmentP(sK3,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,f133,f132,f131,f130]) ).
tff(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& segmentP(X3,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) )
| ( ~ segmentP(X1,sK0)
& segmentP(X3,X2)
& neq(X1,nil) ) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK0)
& segmentP(X3,X2)
& neq(X1,nil) ) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& segmentP(X3,X2)
& neq(sK1,nil) ) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f132,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& segmentP(X3,X2)
& neq(sK1,nil) ) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& segmentP(X3,sK2)
& neq(sK1,nil) ) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f133,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& segmentP(X3,sK2)
& neq(sK1,nil) ) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& segmentP(sK3,sK2)
& neq(sK1,nil) ) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& segmentP(X3,X2)
& 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] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& segmentP(X3,X2)
& 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ~ segmentP(X3,X2)
| ~ 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ~ segmentP(X3,X2)
| ~ neq(X1,nil) ) )
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U8SUZ5SjYQ/Vampire---4.8_20627',co1) ).
tff(f157,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f134]) ).
tff(f253,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f161,f249,f245]) ).
tff(f245,plain,
( spl11_1
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
tff(f161,plain,
( ~ neq(sK3,nil)
| segmentP(sK3,sK2) ),
inference(cnf_transformation,[],[f134]) ).
tff(f252,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f201,f249,f245]) ).
tff(f201,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f162,f155,f156]) ).
tff(f156,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f134]) ).
tff(f162,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC362+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/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.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri May 3 20:28:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/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.U8SUZ5SjYQ/Vampire---4.8_20627
% 0.60/0.76 % (20735)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.60/0.76 % (20741)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 % (20740)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.60/0.76 % (20737)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.60/0.76 % (20738)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.60/0.76 % (20743)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.60/0.76 % (20736)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.60/0.76 % (20742)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.60/0.77 % (20735)First to succeed.
% 0.60/0.77 % (20743)Also succeeded, but the first one will report.
% 0.60/0.77 % (20738)Also succeeded, but the first one will report.
% 0.60/0.77 % (20741)Also succeeded, but the first one will report.
% 0.60/0.77 % (20737)Also succeeded, but the first one will report.
% 0.60/0.77 % (20735)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20734"
% 0.60/0.77 % (20735)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (20735)------------------------------
% 0.60/0.77 % (20735)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (20735)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (20735)Memory used [KB]: 1140
% 0.60/0.77 % (20735)Time elapsed: 0.004 s
% 0.60/0.77 % (20735)Instructions burned: 6 (million)
% 0.60/0.77 % (20734)Success in time 0.39 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------