TSTP Solution File: SYO206^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO206^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 : n029.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.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 47 ( 32 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 30 ( 13 ~; 10 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 78 ( 18 fml; 60 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 17 ( 11 !; 6 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_2,type,
sK0: $o > $o ).
tff(f14,plain,
$false,
inference(subsumption_resolution,[],[f12,f13]) ).
tff(f13,plain,
! [X0: $o] : ( sK0((X0)) != (X0) ),
inference(duplicate_literal_removal,[],[f11]) ).
tff(f11,plain,
! [X0: $o] :
( ( sK0((X0)) != (X0) )
| ( sK0((X0)) != (X0) ) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
! [X0: $o] :
( ( ( sK0((X0)) != (X0) )
| ( sK0((X0)) != (X0) ) )
& ( ( sK0((X0)) = (X0) )
| ( sK0((X0)) = (X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
tff(f8,plain,
! [X0: $o] :
( ? [X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) )
=> ( ( ( sK0((X0)) != (X0) )
| ( sK0((X0)) != (X0) ) )
& ( ( sK0((X0)) = (X0) )
| ( sK0((X0)) = (X0) ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f7,plain,
! [X0: $o] :
? [X1: $o] :
( ( ( (X0) != (X1) )
| ( (X0) != (X1) ) )
& ( ( (X0) = (X1) )
| ( (X0) = (X1) ) ) ),
inference(nnf_transformation,[],[f6]) ).
tff(f6,plain,
! [X0: $o] :
? [X1: $o] :
( ( (X0) = (X1) )
<~> ( (X0) = (X1) ) ),
inference(ennf_transformation,[],[f5]) ).
tff(f5,plain,
~ ? [X0: $o] :
! [X1: $o] :
( ( (X0) = (X1) )
<=> ( (X0) = (X1) ) ),
inference(fool_elimination,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X0: $o] :
! [X1: $o] :
( ( (X0) = (X1) )
= ( (X0) = (X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X0: $o] :
! [X1: $o] :
( ( (X0) = (X1) )
= ( (X0) = (X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cCT265) ).
tff(f12,plain,
! [X0: $o] : ( sK0((X0)) = (X0) ),
inference(duplicate_literal_removal,[],[f10]) ).
tff(f10,plain,
! [X0: $o] :
( ( sK0((X0)) = (X0) )
| ( sK0((X0)) = (X0) ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO206^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n029.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 09:16: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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.37 % (7740)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.37 % (7742)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (7741)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.37 % (7744)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.37 % (7745)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.37 % (7744)First to succeed.
% 0.14/0.37 % (7740)Also succeeded, but the first one will report.
% 0.14/0.37 % (7742)Also succeeded, but the first one will report.
% 0.14/0.37 % (7744)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (7744)------------------------------
% 0.14/0.37 % (7744)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (7744)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (7744)Memory used [KB]: 5373
% 0.14/0.37 % (7744)Time elapsed: 0.003 s
% 0.14/0.37 % (7744)Instructions burned: 1 (million)
% 0.14/0.37 % (7744)------------------------------
% 0.14/0.37 % (7744)------------------------------
% 0.14/0.37 % (7738)Success in time 0.006 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------