TSTP Solution File: NUM667_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM667_8 : TPTP v8.2.0. Released v8.0.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 : Tue May 21 01:44:29 EDT 2024
% Result : Theorem 0.52s 0.70s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 45 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 92 ( 19 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 101 ( 49 ~; 35 |; 3 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 16 ( 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
nat: $tType ).
tff(func_def_0,type,
x: nat ).
tff(func_def_1,type,
y: nat ).
tff(func_def_2,type,
z: nat ).
tff(pred_def_1,type,
less: ( nat * nat ) > $o ).
tff(f72,plain,
$false,
inference(avatar_sat_refutation,[],[f43,f52,f55,f63,f67,f71]) ).
tff(f71,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f70]) ).
tff(f70,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f69,f23]) ).
tff(f23,plain,
~ less(x,z),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
( ( x != z )
& ~ less(x,z) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,negated_conjecture,
~ ( ~ less(x,z)
=> ( x = z ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
( ~ less(x,z)
=> ( x = z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz17) ).
tff(f69,plain,
( less(x,z)
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f38,f51]) ).
tff(f51,plain,
( ( x = y )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f49]) ).
tff(f49,plain,
( spl0_4
<=> ( x = y ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
tff(f38,plain,
( less(y,z)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f36]) ).
tff(f36,plain,
( spl0_1
<=> less(y,z) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f67,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f66]) ).
tff(f66,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f65,f24]) ).
tff(f24,plain,
x != z,
inference(cnf_transformation,[],[f15]) ).
tff(f65,plain,
( ( x = z )
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f42,f51]) ).
tff(f42,plain,
( ( y = z )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f40]) ).
tff(f40,plain,
( spl0_2
<=> ( y = z ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f63,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f62]) ).
tff(f62,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f60,f38]) ).
tff(f60,plain,
( ~ less(y,z)
| ~ spl0_3 ),
inference(resolution,[],[f59,f47]) ).
tff(f47,plain,
( less(x,y)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f45]) ).
tff(f45,plain,
( spl0_3
<=> less(x,y) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
tff(f59,plain,
! [X0: nat] :
( ~ less(x,X0)
| ~ less(X0,z) ),
inference(resolution,[],[f25,f23]) ).
tff(f25,plain,
! [X2: nat,X0: nat,X1: nat] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: nat,X1: nat,X2: nat] :
( less(X0,X2)
| ( ( X1 != X2 )
& ~ less(X1,X2) )
| ~ less(X0,X1) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
! [X0: nat,X1: nat,X2: nat] :
( less(X0,X2)
| ( ( X1 != X2 )
& ~ less(X1,X2) )
| ~ less(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: nat,X1: nat,X2: nat] :
( less(X0,X1)
=> ( ( ~ less(X1,X2)
=> ( X1 = X2 ) )
=> less(X0,X2) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X1: nat,X2: nat,X3: nat] :
( less(X1,X2)
=> ( ( ~ less(X2,X3)
=> ( X2 = X3 ) )
=> less(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz16b) ).
tff(f55,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f54]) ).
tff(f54,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f53,f47]) ).
tff(f53,plain,
( ~ less(x,y)
| ~ spl0_2 ),
inference(backward_demodulation,[],[f23,f42]) ).
tff(f52,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f31,f49,f45]) ).
tff(f31,plain,
( ( x = y )
| less(x,y) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
( ( x = y )
| less(x,y) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
( ~ less(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(f43,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f30,f40,f36]) ).
tff(f30,plain,
( ( y = z )
| less(y,z) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
( ( y = z )
| less(y,z) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,axiom,
( ~ less(y,z)
=> ( y = z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : NUM667_8 : TPTP v8.2.0. Released v8.0.0.
% 0.05/0.12 % 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.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 04:18:38 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.33 This is a TX0_THM_EQU_NAR problem
% 0.11/0.33 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/benchmark/theBenchmark.p
% 0.52/0.69 % (5270)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.69 % (5272)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.69 % (5273)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.52/0.69 % (5274)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.69 % (5275)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.52/0.69 % (5276)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 theBenchmark for (2996ds/83Mi)
% 0.52/0.69 % (5277)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.52/0.69 % (5272)First to succeed.
% 0.52/0.70 % (5272)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5269"
% 0.52/0.70 % (5276)Refutation not found, incomplete strategy% (5276)------------------------------
% 0.52/0.70 % (5276)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.70 % (5276)Termination reason: Refutation not found, incomplete strategy
% 0.52/0.70
% 0.52/0.70 % (5276)Memory used [KB]: 963
% 0.52/0.70 % (5276)Time elapsed: 0.002 s
% 0.52/0.70 % (5276)Instructions burned: 2 (million)
% 0.52/0.70 % (5273)Also succeeded, but the first one will report.
% 0.52/0.70 % (5276)------------------------------
% 0.52/0.70 % (5276)------------------------------
% 0.52/0.70 % (5272)Refutation found. Thanks to Tanya!
% 0.52/0.70 % SZS status Theorem for theBenchmark
% 0.52/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.70 % (5272)------------------------------
% 0.52/0.70 % (5272)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.70 % (5272)Termination reason: Refutation
% 0.52/0.70
% 0.52/0.70 % (5272)Memory used [KB]: 988
% 0.52/0.70 % (5272)Time elapsed: 0.002 s
% 0.52/0.70 % (5272)Instructions burned: 4 (million)
% 0.52/0.70 % (5269)Success in time 0.365 s
% 0.52/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------