TSTP Solution File: SYO215^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO215^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 : n011.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:32 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 23 ( 15 ~; 0 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 27 ( 9 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,plain,
$false,
inference(subsumption_resolution,[],[f11,f10]) ).
fof(f10,plain,
! [X1] : sK0 = X1,
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ! [X1] : sK0 = X1
& sK1 != sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f5,f7,f6]) ).
fof(f6,plain,
( ? [X0] :
! [X1] : X0 = X1
=> ! [X1] : sK0 = X1 ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X2,X3] : X2 != X3
=> sK1 != sK2 ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ? [X0] :
! [X1] : X0 = X1
& ? [X2,X3] : X2 != X3 ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ? [X2] :
! [X3] : X2 = X3
& ? [X1,X0] : X0 != X1 ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X1,X0] : X0 != X1
=> ! [X2] :
? [X3] : X2 != X3 ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X1,X0] : X0 != X1
=> ! [X2] :
? [X3] : X2 != X3 ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X1,X0] : X0 != X1
=> ! [X2] :
? [X3] : X2 != X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM26) ).
fof(f11,plain,
sK1 != sK0,
inference(backward_demodulation,[],[f9,f10]) ).
fof(f9,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO215^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:01:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/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.20/0.37 % (4566)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.20/0.37 % (4568)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.37 % (4569)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.20/0.37 % (4570)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.20/0.37 % (4568)First to succeed.
% 0.20/0.37 % (4566)Also succeeded, but the first one will report.
% 0.20/0.37 % (4565)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.20/0.37 % (4570)Also succeeded, but the first one will report.
% 0.20/0.37 % (4568)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (4568)------------------------------
% 0.20/0.37 % (4568)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (4568)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (4568)Memory used [KB]: 5373
% 0.20/0.37 % (4568)Time elapsed: 0.004 s
% 0.20/0.37 % (4568)Instructions burned: 1 (million)
% 0.20/0.37 % (4568)------------------------------
% 0.20/0.37 % (4568)------------------------------
% 0.20/0.37 % (4564)Success in time 0.008 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------