TSTP Solution File: SYO234^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO234^5 : TPTP v8.2.0. Released v4.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 : n008.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 09:03:35 EDT 2024
% Result : Theorem 0.21s 0.36s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 76 ( 6 equ)
% Maximal formula atoms : 1 ( 10 avg)
% Number of connectives : 8 ( 5 ~; 3 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 66 ( 66 fml; 0 var)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-4 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 12 ( 2 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
d: $tType ).
tff(type_def_6,type,
c: $tType ).
tff(func_def_0,type,
d: $tType ).
tff(func_def_1,type,
c: $tType ).
tff(func_def_2,type,
cB: sTfun(d,sTfun(c,$o)) ).
tff(func_def_3,type,
cA: sTfun(c,sTfun(d,$o)) ).
tff(f8,plain,
$false,
inference(equality_resolution,[],[f7]) ).
tff(f7,plain,
! [X0: sTfun(c,sTfun(d,$o))] : ( vLAM(c,sTfun(d,$o),vLAM(d,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(d,$o,vAPP(c,sTfun(d,$o),cA,db1(c)),db0(d))),vAPP(c,$o,vAPP(d,sTfun(c,$o),cB,db0(d)),db1(c))))) != X0 ),
inference(cnf_transformation,[],[f6]) ).
tff(f6,plain,
! [X0: sTfun(c,sTfun(d,$o))] : ( vLAM(c,sTfun(d,$o),vLAM(d,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(d,$o,vAPP(c,sTfun(d,$o),cA,db1(c)),db0(d))),vAPP(c,$o,vAPP(d,sTfun(c,$o),cB,db0(d)),db1(c))))) != X0 ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ? [X0: sTfun(c,sTfun(d,$o))] : ( vLAM(c,sTfun(d,$o),vLAM(d,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(d,$o,vAPP(c,sTfun(d,$o),cA,db1(c)),db0(d))),vAPP(c,$o,vAPP(d,sTfun(c,$o),cB,db0(d)),db1(c))))) = X0 ),
inference(fool_elimination,[],[f4]) ).
tff(f4,plain,
~ ? [X0: sTfun(c,sTfun(d,$o))] :
( X0
= ( ^ [X1: c,X2: d] :
( vAPP(c,$o,vAPP(d,sTfun(c,$o),cB,X2),X1)
| vAPP(d,$o,vAPP(c,sTfun(d,$o),cA,X1),X2) ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X0: sTfun(c,sTfun(d,$o))] :
( X0
= ( ^ [X1: c,X2: d] :
( vAPP(c,$o,vAPP(d,sTfun(c,$o),cB,X2),X1)
| vAPP(d,$o,vAPP(c,sTfun(d,$o),cA,X1),X2) ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X0: sTfun(c,sTfun(d,$o))] :
( X0
= ( ^ [X1: c,X2: d] :
( vAPP(c,$o,vAPP(d,sTfun(c,$o),cB,X2),X1)
| vAPP(d,$o,vAPP(c,sTfun(d,$o),cA,X1),X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSV4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO234^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % 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.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 10:41:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.36 % (21655)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.21/0.36 % (21655)First to succeed.
% 0.21/0.36 % (21655)Refutation found. Thanks to Tanya!
% 0.21/0.36 % SZS status Theorem for theBenchmark
% 0.21/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.36 % (21655)------------------------------
% 0.21/0.36 % (21655)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.36 % (21655)Termination reason: Refutation
% 0.21/0.36
% 0.21/0.36 % (21655)Memory used [KB]: 5373
% 0.21/0.36 % (21655)Time elapsed: 0.001 s
% 0.21/0.36 % (21655)------------------------------
% 0.21/0.36 % (21655)------------------------------
% 0.21/0.36 % (21652)Success in time 0.008 s
% 0.21/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------