TSTP Solution File: DAT085_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : DAT085_1 : TPTP v8.1.2. Released v6.1.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 : n017.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 02:18:47 EDT 2024

% Result   : Theorem 0.62s 0.79s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   42 (  14 unt;  16 typ;   0 def)
%            Number of atoms       :   38 (  31 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   25 (  13   ~;   8   |;   0   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number arithmetic     :   55 (   6 atm;   9 fun;  16 num;  24 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   25 (  14   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  13 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (  46   !;   0   ?;  46   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    list: $tType ).

tff(func_def_0,type,
    nil: list ).

tff(func_def_1,type,
    cons: ( $int * list ) > list ).

tff(func_def_2,type,
    head: list > $int ).

tff(func_def_3,type,
    tail: list > list ).

tff(func_def_5,type,
    length: list > $int ).

tff(func_def_8,type,
    count: ( $int * list ) > $int ).

tff(func_def_9,type,
    append: ( list * list ) > list ).

tff(func_def_11,type,
    sK0: ( $int * list ) > $int ).

tff(func_def_12,type,
    sK1: ( $int * list ) > list ).

tff(func_def_13,type,
    sK2: ( $int * list ) > $int ).

tff(func_def_14,type,
    sK3: ( $int * list ) > list ).

tff(func_def_15,type,
    sK4: ( $int * list ) > $int ).

tff(func_def_16,type,
    sK5: ( $int * list ) > list ).

tff(pred_def_1,type,
    in: ( $int * list ) > $o ).

tff(pred_def_2,type,
    inRange: ( $int * list ) > $o ).

tff(f545,plain,
    $false,
    inference(resolution,[],[f344,f24]) ).

tff(f24,plain,
    ! [X0: $int] : ~ $less(X0,X0),
    introduced(theory_axiom_142,[]) ).

tff(f344,plain,
    ! [X0: $int,X1: $int] : $less(X0,X1),
    inference(forward_demodulation,[],[f277,f57]) ).

tff(f57,plain,
    ! [X0: $int,X1: list] : ( head(cons(X0,X1)) = X0 ),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    ! [X0: $int,X1: list] : ( head(cons(X0,X1)) = X0 ),
    file('/export/starexec/sandbox2/tmp/tmp.9RPBj8u24v/Vampire---4.8_26391',l1) ).

tff(f277,plain,
    ! [X0: $int,X1: $int] : $less(X0,head(cons(X1,nil))),
    inference(superposition,[],[f105,f244]) ).

tff(f244,plain,
    ! [X0: $int,X1: $int] : ( head(cons(X1,nil)) = X0 ),
    inference(superposition,[],[f57,f236]) ).

tff(f236,plain,
    ! [X0: $int,X1: $int] : ( cons(X0,nil) = cons(X1,nil) ),
    inference(evaluation,[],[f233]) ).

tff(f233,plain,
    ! [X0: $int,X1: $int] :
      ( ( 1 != $sum(1,0) )
      | ( cons(X0,nil) = cons(X1,nil) ) ),
    inference(superposition,[],[f229,f73]) ).

tff(f73,plain,
    0 = length(nil),
    inference(cnf_transformation,[],[f7]) ).

tff(f7,axiom,
    0 = length(nil),
    file('/export/starexec/sandbox2/tmp/tmp.9RPBj8u24v/Vampire---4.8_26391',l) ).

tff(f229,plain,
    ! [X2: $int,X0: $int,X1: list] :
      ( ( 1 != $sum(1,length(X1)) )
      | ( cons(X0,X1) = cons(X2,nil) ) ),
    inference(superposition,[],[f227,f74]) ).

tff(f74,plain,
    ! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
    inference(cnf_transformation,[],[f34]) ).

tff(f34,plain,
    ! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
    inference(rectify,[],[f8]) ).

tff(f8,axiom,
    ! [X3: $int,X4: list] : ( length(cons(X3,X4)) = $sum(1,length(X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9RPBj8u24v/Vampire---4.8_26391',l_1) ).

tff(f227,plain,
    ! [X0: list,X1: $int] :
      ( ( 1 != length(X0) )
      | ( cons(X1,nil) = X0 ) ),
    inference(evaluation,[],[f223]) ).

tff(f223,plain,
    ! [X0: list,X1: $int] :
      ( ( length(X0) != $sum(1,0) )
      | ( cons(X1,nil) = X0 ) ),
    inference(superposition,[],[f218,f73]) ).

tff(f218,plain,
    ! [X2: list,X0: $int,X1: list] :
      ( ( $sum(1,length(X1)) != length(X2) )
      | ( cons(X0,X1) = X2 ) ),
    inference(superposition,[],[f82,f74]) ).

tff(f82,plain,
    ! [X0: list,X1: list] :
      ( ( length(X1) != length(X0) )
      | ( X0 = X1 ) ),
    inference(cnf_transformation,[],[f44]) ).

tff(f44,plain,
    ! [X0: list,X1: list] :
      ( ( X0 = X1 )
      | ( length(X1) != length(X0) ) ),
    inference(ennf_transformation,[],[f41]) ).

tff(f41,plain,
    ! [X0: list,X1: list] :
      ( ( length(X1) = length(X0) )
     => ( X0 = X1 ) ),
    inference(flattening,[],[f40]) ).

tff(f40,plain,
    ~ ~ ! [X0: list,X1: list] :
          ( ( length(X1) = length(X0) )
         => ( X0 = X1 ) ),
    inference(rectify,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ~ ! [X7: list,X8: list] :
          ( ( length(X7) = length(X8) )
         => ( X7 = X8 ) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ~ ! [X7: list,X8: list] :
        ( ( length(X7) = length(X8) )
       => ( X7 = X8 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9RPBj8u24v/Vampire---4.8_26391',c) ).

tff(f105,plain,
    ! [X0: $int] : $less(X0,$sum(X0,1)),
    inference(resolution,[],[f28,f24]) ).

tff(f28,plain,
    ! [X0: $int,X1: $int] :
      ( $less(X1,$sum(X0,1))
      | $less(X0,X1) ),
    introduced(theory_axiom_147,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : DAT085_1 : TPTP v8.1.2. Released v6.1.0.
% 0.09/0.10  % 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.09/0.30  % Computer : n017.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Tue Apr 30 16:03:34 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.09/0.30  This is a TF0_THM_EQU_ARI problem
% 0.09/0.30  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.9RPBj8u24v/Vampire---4.8_26391
% 0.55/0.78  % (26505)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.55/0.78  % (26507)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.55/0.78  % (26506)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.55/0.78  % (26503)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.55/0.78  % (26508)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.55/0.78  % (26504)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.55/0.78  % (26509)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.55/0.78  % (26510)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.55/0.78  % (26506)Refutation not found, incomplete strategy% (26506)------------------------------
% 0.55/0.78  % (26506)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.78  % (26506)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.78  
% 0.55/0.78  % (26506)Memory used [KB]: 957
% 0.55/0.78  % (26506)Time elapsed: 0.003 s
% 0.55/0.78  % (26506)Instructions burned: 2 (million)
% 0.55/0.78  % (26506)------------------------------
% 0.55/0.78  % (26506)------------------------------
% 0.55/0.78  % (26503)Refutation not found, incomplete strategy% (26503)------------------------------
% 0.55/0.78  % (26503)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.78  % (26503)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.78  
% 0.55/0.78  % (26503)Memory used [KB]: 972
% 0.55/0.78  % (26503)Time elapsed: 0.003 s
% 0.55/0.78  % (26503)Instructions burned: 3 (million)
% 0.55/0.78  % (26503)------------------------------
% 0.55/0.78  % (26503)------------------------------
% 0.55/0.78  % (26510)Refutation not found, incomplete strategy% (26510)------------------------------
% 0.55/0.78  % (26510)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.78  % (26510)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.78  
% 0.55/0.78  % (26510)Memory used [KB]: 960
% 0.55/0.78  % (26510)Time elapsed: 0.003 s
% 0.55/0.78  % (26510)Instructions burned: 3 (million)
% 0.55/0.78  % (26510)------------------------------
% 0.55/0.78  % (26510)------------------------------
% 0.55/0.78  % (26511)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 (2995ds/55Mi)
% 0.55/0.78  % (26513)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.55/0.78  % (26512)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.55/0.78  % (26512)Refutation not found, incomplete strategy% (26512)------------------------------
% 0.55/0.78  % (26512)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.78  % (26512)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.78  
% 0.55/0.78  % (26512)Memory used [KB]: 1034
% 0.55/0.78  % (26512)Time elapsed: 0.003 s
% 0.55/0.78  % (26512)Instructions burned: 4 (million)
% 0.55/0.78  % (26512)------------------------------
% 0.55/0.78  % (26512)------------------------------
% 0.55/0.78  % (26504)First to succeed.
% 0.62/0.79  % (26504)Refutation found. Thanks to Tanya!
% 0.62/0.79  % SZS status Theorem for Vampire---4
% 0.62/0.79  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79  % (26504)------------------------------
% 0.62/0.79  % (26504)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (26504)Termination reason: Refutation
% 0.62/0.79  
% 0.62/0.79  % (26504)Memory used [KB]: 1109
% 0.62/0.79  % (26504)Time elapsed: 0.011 s
% 0.62/0.79  % (26504)Instructions burned: 17 (million)
% 0.62/0.79  % (26504)------------------------------
% 0.62/0.79  % (26504)------------------------------
% 0.62/0.79  % (26499)Success in time 0.478 s
% 0.62/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------