TSTP Solution File: SYO231^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO231^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 : n018.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.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 7 unt; 2 typ; 0 def)
% Number of atoms : 46 ( 6 equ)
% Maximal formula atoms : 1 ( 6 avg)
% Number of connectives : 11 ( 8 ~; 0 |; 3 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 36 ( 36 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-4 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 2 !; 4 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
cB: sTfun($i,$o) ).
tff(func_def_1,type,
cA: sTfun($i,$o) ).
tff(f8,plain,
$false,
inference(equality_resolution,[],[f7]) ).
tff(f7,plain,
! [X0: sTfun($i,$o)] : ( vLAM($i,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP($o,$o,vNOT,vAPP($i,$o,cA,db0($i)))),vAPP($i,$o,cB,db0($i)))) != X0 ),
inference(cnf_transformation,[],[f6]) ).
tff(f6,plain,
! [X0: sTfun($i,$o)] : ( vLAM($i,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP($o,$o,vNOT,vAPP($i,$o,cA,db0($i)))),vAPP($i,$o,cB,db0($i)))) != X0 ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ? [X0: sTfun($i,$o)] : ( vLAM($i,$o,vAPP($o,$o,vAPP($o,sTfun($o,$o),vAND,vAPP($o,$o,vNOT,vAPP($i,$o,cA,db0($i)))),vAPP($i,$o,cB,db0($i)))) = X0 ),
inference(fool_elimination,[],[f4]) ).
tff(f4,plain,
~ ? [X0: sTfun($i,$o)] :
( X0
= ( ^ [X1: $i] :
( vAPP($i,$o,cB,X1)
& ~ vAPP($i,$o,cA,X1) ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X0: sTfun($i,$o)] :
( X0
= ( ^ [X1: $i] :
( vAPP($i,$o,cB,X1)
& ~ vAPP($i,$o,cA,X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X0: sTfun($i,$o)] :
( X0
= ( ^ [X1: $i] :
( vAPP($i,$o,cB,X1)
& ~ vAPP($i,$o,cA,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cSV6) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15 % Problem : SYO231^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/0.17 % 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.16/0.38 % Computer : n018.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 11:01:08 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 This is a TH0_THM_EQU_NAR problem
% 0.16/0.39 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.16/0.41 % (13551)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.16/0.41 % (13554)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.41 % (13553)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.16/0.41 % (13557)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.41 % (13558)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.16/0.41 % (13555)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.41 % (13556)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.16/0.41 % (13552)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.16/0.41 % (13558)First to succeed.
% 0.16/0.41 % (13557)Also succeeded, but the first one will report.
% 0.16/0.41 % (13555)Instruction limit reached!
% 0.16/0.41 % (13555)------------------------------
% 0.16/0.41 % (13555)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (13555)Termination reason: Unknown
% 0.16/0.41 % (13555)Termination phase: Saturation
% 0.16/0.41
% 0.16/0.41 % (13555)Memory used [KB]: 5500
% 0.16/0.41 % (13555)Time elapsed: 0.003 s
% 0.16/0.41 % (13555)Instructions burned: 2 (million)
% 0.16/0.41 % (13555)------------------------------
% 0.16/0.41 % (13555)------------------------------
% 0.16/0.41 % (13558)Refutation found. Thanks to Tanya!
% 0.16/0.41 % SZS status Theorem for theBenchmark
% 0.16/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.41 % (13558)------------------------------
% 0.16/0.41 % (13558)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.41 % (13558)Termination reason: Refutation
% 0.16/0.41
% 0.16/0.41 % (13558)Memory used [KB]: 5373
% 0.16/0.41 % (13558)Time elapsed: 0.002 s
% 0.16/0.41 % (13558)------------------------------
% 0.16/0.41 % (13558)------------------------------
% 0.16/0.41 % (13550)Success in time 0.016 s
% 0.16/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------