TSTP Solution File: SYO207^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO207^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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:29 EDT 2024
% Result : Theorem 0.14s 0.36s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 68 ( 39 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 36 ( 16 ~; 12 |; 5 &)
% ( 1 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 78 ( 34 fml; 44 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 16 ( 8 !; 8 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(f16,plain,
$false,
inference(subsumption_resolution,[],[f14,f15]) ).
tff(f15,plain,
sK1 != sK0,
inference(duplicate_literal_removal,[],[f13]) ).
tff(f13,plain,
( ( sK1 != sK0 )
| ( sK1 != sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( ( ( sK1 != sK0 )
| ( sK1 != sK0 ) )
& ( ( sK1 = sK0 )
| ( sK1 = sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10]) ).
tff(f10,plain,
( ? [X0: $o,X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) )
=> ( ( ( sK1 != sK0 )
| ( sK1 != sK0 ) )
& ( ( sK1 = sK0 )
| ( sK1 = sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f9,plain,
? [X0: $o,X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
? [X1: $o,X0: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) ),
inference(nnf_transformation,[],[f7]) ).
tff(f7,plain,
? [X1: $o,X0: $o] :
( ( (X0) = (X1) )
<~> ( (X0) = (X1) ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
~ ! [X1: $o,X0: $o] :
( ( (X0) = (X1) )
<=> ( (X0) = (X1) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ! [X0: $o,X1: $o] :
( ( (X0) = (X1) )
= ( (X0) = (X1) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X1: $o,X0: $o] :
( ( (X0) = (X1) )
= ( (X0) = (X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X1: $o,X0: $o] :
( ( (X0) = (X1) )
= ( (X0) = (X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT26) ).
tff(f14,plain,
sK1 = sK0,
inference(duplicate_literal_removal,[],[f12]) ).
tff(f12,plain,
( ( sK1 = sK0 )
| ( sK1 = sK0 ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO207^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % 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.34 % Computer : n022.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 11:16:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_EQU_NAR problem
% 0.14/0.34 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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 % (12598)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.14/0.36 % (12593)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.14/0.36 % (12598)First to succeed.
% 0.14/0.36 % (12594)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.14/0.36 % (12596)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.36 % (12595)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.14/0.36 % (12597)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.14/0.36 % (12599)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.36 % (12593)Also succeeded, but the first one will report.
% 0.14/0.36 % (12598)Refutation found. Thanks to Tanya!
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.36 % (12598)------------------------------
% 0.14/0.36 % (12598)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (12598)Termination reason: Refutation
% 0.14/0.36
% 0.14/0.36 % (12598)Memory used [KB]: 5373
% 0.14/0.36 % (12598)Time elapsed: 0.003 s
% 0.14/0.36 % (12598)------------------------------
% 0.14/0.36 % (12598)------------------------------
% 0.14/0.36 % (12592)Success in time 0.004 s
% 0.14/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------