TSTP Solution File: NUM664_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM664_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/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 : Tue May 21 01:44:25 EDT 2024
% Result : Theorem 0.64s 0.81s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 33 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 1 usr; 1 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(f29,plain,
$false,
inference(subsumption_resolution,[],[f27,f17]) ).
tff(f17,plain,
less(x,y),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
less(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(f27,plain,
~ less(x,y),
inference(superposition,[],[f16,f23]) ).
tff(f23,plain,
y = z,
inference(resolution,[],[f21,f19]) ).
tff(f19,plain,
( less(y,z)
| ( y = z ) ),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
( ( y = z )
| less(y,z) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,axiom,
( ~ less(y,z)
=> ( y = z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
tff(f21,plain,
~ less(y,z),
inference(resolution,[],[f20,f17]) ).
tff(f20,plain,
! [X0: nat] :
( ~ less(x,X0)
| ~ less(X0,z) ),
inference(resolution,[],[f16,f18]) ).
tff(f18,plain,
! [X2: nat,X0: nat,X1: nat] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
tff(f14,plain,
! [X0: nat,X1: nat,X2: nat] :
( less(X0,X2)
| ~ less(X1,X2)
| ~ less(X0,X1) ),
inference(flattening,[],[f13]) ).
tff(f13,plain,
! [X0: nat,X1: nat,X2: nat] :
( less(X0,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)
=> less(X0,X2) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X1: nat,X2: nat,X3: nat] :
( less(X1,X2)
=> ( less(X2,X3)
=> less(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz15) ).
tff(f16,plain,
~ less(x,z),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
~ less(x,z),
inference(flattening,[],[f6]) ).
tff(f6,negated_conjecture,
~ less(x,z),
inference(negated_conjecture,[],[f5]) ).
tff(f5,conjecture,
less(x,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz16b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM664_8 : TPTP v8.2.0. Released v8.0.0.
% 0.08/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.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 04:07:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TX0_THM_EQU_NAR problem
% 0.14/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/benchmark/theBenchmark.p
% 0.64/0.81 % (9228)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.64/0.81 % (9223)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 (2995ds/34Mi)
% 0.64/0.81 % (9225)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.64/0.81 % (9224)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 theBenchmark for (2995ds/51Mi)
% 0.64/0.81 % (9228)First to succeed.
% 0.64/0.81 % (9228)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9222"
% 0.64/0.81 % (9228)Refutation found. Thanks to Tanya!
% 0.64/0.81 % SZS status Theorem for theBenchmark
% 0.64/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.64/0.81 % (9228)------------------------------
% 0.64/0.81 % (9228)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.81 % (9228)Termination reason: Refutation
% 0.64/0.81
% 0.64/0.81 % (9228)Memory used [KB]: 972
% 0.64/0.81 % (9228)Time elapsed: 0.002 s
% 0.64/0.81 % (9228)Instructions burned: 2 (million)
% 0.64/0.81 % (9222)Success in time 0.437 s
% 0.64/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------