TSTP Solution File: SYO203^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO203^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:28 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 121 ( 34 equ)
% Maximal formula atoms : 6 ( 8 avg)
% Number of connectives : 63 ( 25 ~; 7 |; 6 &)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 68 ( 68 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 5 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f17,plain,
$false,
inference(subsumption_resolution,[],[f16,f15]) ).
tff(f15,plain,
q = $true,
inference(trivial_inequality_removal,[],[f14]) ).
tff(f14,plain,
( ( $true != $true )
| ( q = $true ) ),
inference(definition_unfolding,[],[f10,f11]) ).
tff(f11,plain,
p = $true,
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ( ( r = $true )
| ( q != $true ) )
& ( r != $true )
& ( p = $true )
& ( ( q = $true )
| ( p != $true ) ) ),
inference(flattening,[],[f8]) ).
tff(f8,plain,
( ( r != $true )
& ( p = $true )
& ( ( q = $true )
| ( p != $true ) )
& ( ( r = $true )
| ( q != $true ) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( ( ( q = $true )
=> ( r = $true ) )
=> ( ( ( q != $true )
=> ( p != $true ) )
=> ( ( p = $true )
=> ( r = $true ) ) ) ),
inference(flattening,[],[f6]) ).
tff(f6,plain,
~ ( ( ( q = $true )
=> ( r = $true ) )
=> ( ( ( q != $true )
=> ( p != $true ) )
=> ( ( p = $true )
=> ( r = $true ) ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ( ( q
=> r )
=> ( ( ~ q
=> ~ p )
=> ( p
=> r ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( q
=> r )
=> ( ( ~ q
=> ~ p )
=> ( p
=> r ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( q
=> r )
=> ( ( ~ q
=> ~ p )
=> ( p
=> r ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPROP_2003_3_13) ).
tff(f10,plain,
( ( q = $true )
| ( p != $true ) ),
inference(cnf_transformation,[],[f9]) ).
tff(f16,plain,
q != $true,
inference(subsumption_resolution,[],[f13,f12]) ).
tff(f12,plain,
r != $true,
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
( ( r = $true )
| ( q != $true ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO203^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 09:20:38 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.37 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.15/0.39 % (10160)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.15/0.39 % (10153)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.15/0.39 % (10156)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (10155)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.15/0.39 % (10154)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.15/0.39 % (10153)First to succeed.
% 0.15/0.39 % (10154)Also succeeded, but the first one will report.
% 0.15/0.39 % (10157)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.15/0.39 % (10159)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.39 % (10155)Also succeeded, but the first one will report.
% 0.15/0.39 % (10153)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (10153)------------------------------
% 0.15/0.39 % (10153)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (10153)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (10153)Memory used [KB]: 5373
% 0.15/0.39 % (10153)Time elapsed: 0.003 s
% 0.15/0.39 % (10153)Instructions burned: 1 (million)
% 0.15/0.39 % (10153)------------------------------
% 0.15/0.39 % (10153)------------------------------
% 0.15/0.39 % (10152)Success in time 0.007 s
% 0.15/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------