TSTP Solution File: SYO202^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO202^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 : n027.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:28 EDT 2024
% Result : Theorem 0.20s 0.36s
% Output : Refutation 0.20s
% 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 : 69 ( 32 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 46 ( 17 ~; 0 |; 8 &; 20 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 1 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 0 !; 6 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_4,type,
sK0: $o > $o ).
thf(f13,plain,
$false,
inference(subsumption_resolution,[],[f11,f12]) ).
thf(f12,plain,
( ( sK0 @ $true )
= $true ),
inference(boolean_simplification,[],[f9]) ).
thf(f9,plain,
( ( sK0 @ ( sK0 = sK0 ) )
= $true ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( ( sK0 @ ( sK0 = sK0 ) )
!= $true )
& ( ( sK0 @ ( sK0 = sK0 ) )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: $o > $o] :
( ( ( X0 @ ( X0 = X0 ) )
!= $true )
& ( ( X0 @ ( X0 = X0 ) )
= $true ) )
=> ( ( ( sK0 @ ( sK0 = sK0 ) )
!= $true )
& ( ( sK0 @ ( sK0 = sK0 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: $o > $o] :
( ( ( X0 @ ( X0 = X0 ) )
!= $true )
& ( ( X0 @ ( X0 = X0 ) )
= $true ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ~ ? [X0: $o > $o] :
( ( ( X0 @ ( X0 = X0 ) )
!= $true )
& ( ( X0 @ ( X0 = X0 ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ~ ? [X0: $o > $o] :
( ~ ( X0 @ ( X0 = X0 ) )
& ( X0 @ ( X0 = X0 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ~ ? [X0: $o > $o] :
( ~ ( X0 @ ( X0 = X0 ) )
& ( X0 @ ( X0 = X0 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
~ ? [X0: $o > $o] :
( ~ ( X0 @ ( X0 = X0 ) )
& ( X0 @ ( X0 = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cCT22) ).
thf(f11,plain,
( ( sK0 @ $true )
!= $true ),
inference(boolean_simplification,[],[f10]) ).
thf(f10,plain,
( ( sK0 @ ( sK0 = sK0 ) )
!= $true ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO202^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n027.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:45:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.36 % (26173)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.20/0.36 % (26166)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.36 % (26169)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.36 % (26173)First to succeed.
% 0.20/0.36 % (26166)Also succeeded, but the first one will report.
% 0.20/0.36 % (26173)Refutation found. Thanks to Tanya!
% 0.20/0.36 % SZS status Theorem for theBenchmark
% 0.20/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.36 % (26173)------------------------------
% 0.20/0.36 % (26173)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36 % (26173)Termination reason: Refutation
% 0.20/0.36
% 0.20/0.36 % (26173)Memory used [KB]: 5373
% 0.20/0.36 % (26173)Time elapsed: 0.003 s
% 0.20/0.36 % (26173)Instructions burned: 1 (million)
% 0.20/0.36 % (26173)------------------------------
% 0.20/0.36 % (26173)------------------------------
% 0.20/0.36 % (26165)Success in time 0.003 s
% 0.20/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------