TSTP Solution File: NUM691_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM691_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 : n010.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:49 EDT 2024
% Result : Theorem 0.52s 0.73s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 109 ( 24 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 113 ( 49 ~; 41 |; 5 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 50 !; 0 ?; 50 :)
% 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(func_def_3,type,
u: nat ).
tff(func_def_4,type,
pl: ( nat * nat ) > nat ).
tff(pred_def_1,type,
more: ( nat * nat ) > $o ).
tff(f70,plain,
$false,
inference(avatar_sat_refutation,[],[f42,f51,f64,f69]) ).
tff(f69,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f68]) ).
tff(f68,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(subsumption_resolution,[],[f65,f35]) ).
tff(f35,plain,
( more(x,y)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f34,plain,
( spl0_1
<=> more(x,y) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f65,plain,
( ~ more(x,y)
| spl0_2 ),
inference(resolution,[],[f53,f29]) ).
tff(f29,plain,
! [X3: nat,X0: nat,X1: nat] :
( more(pl(X0,X3),pl(X1,X3))
| ~ more(X0,X1) ),
inference(equality_resolution,[],[f26]) ).
tff(f26,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ( X2 != X3 )
| ~ more(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ( ( X2 != X3 )
& ~ more(X2,X3) )
| ~ more(X0,X1) ),
inference(flattening,[],[f17]) ).
tff(f17,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ( ( X2 != X3 )
& ~ more(X2,X3) )
| ~ more(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( more(X0,X1)
=> ( ( ~ more(X2,X3)
=> ( X2 = X3 ) )
=> more(pl(X0,X2),pl(X1,X3)) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( more(X1,X2)
=> ( ( ~ more(X3,X4)
=> ( X3 = X4 ) )
=> more(pl(X1,X3),pl(X2,X4)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22b) ).
tff(f53,plain,
( ~ more(pl(x,z),pl(y,z))
| spl0_2 ),
inference(superposition,[],[f21,f52]) ).
tff(f52,plain,
( ( z = u )
| spl0_2 ),
inference(resolution,[],[f40,f24]) ).
tff(f24,plain,
( more(z,u)
| ( z = u ) ),
inference(cnf_transformation,[],[f16]) ).
tff(f16,plain,
( ( z = u )
| more(z,u) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,axiom,
( ~ more(z,u)
=> ( z = u ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
tff(f40,plain,
( ~ more(z,u)
| spl0_2 ),
inference(avatar_component_clause,[],[f38]) ).
tff(f38,plain,
( spl0_2
<=> more(z,u) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f21,plain,
~ more(pl(x,z),pl(y,u)),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
( ( pl(x,z) != pl(y,u) )
& ~ more(pl(x,z),pl(y,u)) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,negated_conjecture,
~ ( ~ more(pl(x,z),pl(y,u))
=> ( pl(x,z) = pl(y,u) ) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
( ~ more(pl(x,z),pl(y,u))
=> ( pl(x,z) = pl(y,u) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23) ).
tff(f64,plain,
( spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f63]) ).
tff(f63,plain,
( $false
| spl0_1
| spl0_2 ),
inference(trivial_inequality_removal,[],[f62]) ).
tff(f62,plain,
( ( pl(x,z) != pl(x,z) )
| spl0_1
| spl0_2 ),
inference(forward_demodulation,[],[f54,f43]) ).
tff(f43,plain,
( ( x = y )
| spl0_1 ),
inference(resolution,[],[f36,f23]) ).
tff(f23,plain,
( more(x,y)
| ( x = y ) ),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
( ( x = y )
| more(x,y) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
( ~ more(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
tff(f36,plain,
( ~ more(x,y)
| spl0_1 ),
inference(avatar_component_clause,[],[f34]) ).
tff(f54,plain,
( ( pl(x,z) != pl(y,z) )
| spl0_2 ),
inference(superposition,[],[f22,f52]) ).
tff(f22,plain,
pl(x,z) != pl(y,u),
inference(cnf_transformation,[],[f14]) ).
tff(f51,plain,
( ~ spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f50,f34,f38]) ).
tff(f50,plain,
( ~ more(z,u)
| spl0_1 ),
inference(resolution,[],[f46,f30]) ).
tff(f30,plain,
! [X2: nat,X3: nat,X1: nat] :
( more(pl(X1,X2),pl(X1,X3))
| ~ more(X2,X3) ),
inference(equality_resolution,[],[f28]) ).
tff(f28,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ~ more(X2,X3)
| ( X0 != X1 ) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ~ more(X2,X3)
| ( ( X0 != X1 )
& ~ more(X0,X1) ) ),
inference(flattening,[],[f19]) ).
tff(f19,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ~ more(X2,X3)
| ( ( X0 != X1 )
& ~ more(X0,X1) ) ),
inference(ennf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ~ more(X0,X1)
=> ( X0 = X1 ) )
=> ( more(X2,X3)
=> more(pl(X0,X2),pl(X1,X3)) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( ~ more(X1,X2)
=> ( X1 = X2 ) )
=> ( more(X3,X4)
=> more(pl(X1,X3),pl(X2,X4)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz22a) ).
tff(f46,plain,
( ~ more(pl(x,z),pl(x,u))
| spl0_1 ),
inference(superposition,[],[f21,f43]) ).
tff(f42,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f32,f38,f34]) ).
tff(f32,plain,
( ~ more(z,u)
| ~ more(x,y) ),
inference(resolution,[],[f21,f25]) ).
tff(f25,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( more(pl(X0,X2),pl(X1,X3))
| ~ more(X2,X3)
| ~ more(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM691_8 : TPTP v8.2.0. Released v8.0.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 : n010.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 : Mon May 20 07:37:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TX0_THM_EQU_NAR 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/benchmark/theBenchmark.p
% 0.52/0.73 % (23968)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.73 % (23963)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.73 % (23965)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.73 % (23966)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.73 % (23967)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.73 % (23968)First to succeed.
% 0.52/0.73 % (23968)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-23962"
% 0.52/0.73 % (23968)Refutation found. Thanks to Tanya!
% 0.52/0.73 % SZS status Theorem for theBenchmark
% 0.52/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.73 % (23968)------------------------------
% 0.52/0.73 % (23968)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73 % (23968)Termination reason: Refutation
% 0.52/0.73
% 0.52/0.73 % (23968)Memory used [KB]: 989
% 0.52/0.73 % (23968)Time elapsed: 0.003 s
% 0.52/0.73 % (23968)Instructions burned: 4 (million)
% 0.52/0.73 % (23962)Success in time 0.375 s
% 0.52/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------