TSTP Solution File: SYO089^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO089^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 : n010.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:02:54 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 394 ( 111 equ)
% Maximal formula atoms : 20 ( 20 avg)
% Number of connectives : 271 ( 118 ~; 78 |; 70 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 222 ( 222 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f39,plain,
$false,
inference(subsumption_resolution,[],[f32,f37]) ).
tff(f37,plain,
p = $true,
inference(trivial_inequality_removal,[],[f36]) ).
tff(f36,plain,
( ( $true != $true )
| ( p = $true ) ),
inference(duplicate_literal_removal,[],[f28]) ).
tff(f28,plain,
( ( p = $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f11,f19,f20,f10]) ).
tff(f10,plain,
t = $true,
inference(cnf_transformation,[],[f9]) ).
tff(f9,plain,
( ( q = $true )
& ( s = $true )
& ( ( ( ( q != $true )
| ( s != $true )
| ( t != $true )
| ( p != $true ) )
& ( t = $true )
& ( s = $true )
& ( q = $true ) )
| ( s != $true )
| ( t != $true )
| ( q != $true ) )
& ( ( s != $true )
| ( q != $true )
| ( ( t = $true )
& ( s = $true )
& ( q = $true )
& ( p = $true ) )
| ( t != $true ) )
& ( t = $true ) ),
inference(flattening,[],[f8]) ).
tff(f8,plain,
( ( q = $true )
& ( ( q != $true )
| ( ( s = $true )
& ( t = $true )
& ( q = $true )
& ( p = $true ) )
| ( s != $true )
| ( t != $true ) )
& ( t = $true )
& ( s = $true )
& ( ( ( t = $true )
& ( s = $true )
& ( ( q != $true )
| ( p != $true )
| ( s != $true )
| ( t != $true ) )
& ( q = $true ) )
| ( t != $true )
| ( q != $true )
| ( s != $true ) ) ),
inference(ennf_transformation,[],[f7]) ).
tff(f7,plain,
~ ( ( ~ ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( ~ ( ( q = $true )
& ( p = $true ) )
| ~ ( ( s = $true )
& ( t = $true ) ) )
& ( q = $true ) ) )
| ( t != $true )
| ( q != $true )
| ( s != $true ) )
=> ( ~ ( ( q = $true )
& ( ~ ( ( q = $true )
& ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) )
| ~ ( ( s = $true )
& ( t = $true ) ) ) )
| ~ ( ( t = $true )
& ( s = $true ) ) ) ),
inference(flattening,[],[f6]) ).
tff(f6,plain,
~ ( ( ~ ( ~ ( ( t = $true )
& ( s = $true ) )
| ~ ( ( ~ ( ( q = $true )
& ( p = $true ) )
| ~ ( ( s = $true )
& ( t = $true ) ) )
& ( q = $true ) ) )
| ( s != $true )
| ( q != $true )
| ( t != $true ) )
=> ( ~ ( ( q = $true )
& ( ~ ( ( q = $true )
& ( ~ ( ( s = $true )
& ( t = $true ) )
| ~ ( ( q = $true )
& ( p = $true ) ) ) )
| ~ ( ( s = $true )
& ( t = $true ) ) ) )
| ~ ( ( t = $true )
& ( s = $true ) ) ) ),
inference(fool_elimination,[],[f5]) ).
tff(f5,plain,
~ ( ( ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) )
| ~ s
| ~ q
| ~ t )
=> ( ~ ( s
& t )
| ~ ( ( ~ ( q
& ( ~ ( q
& p )
| ~ ( s
& t ) ) )
| ~ ( s
& t ) )
& q ) ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) )
| ~ s
| ~ q
| ~ t )
=> ( ~ ( s
& t )
| ~ ( ( ~ ( q
& ( ~ ( q
& p )
| ~ ( s
& t ) ) )
| ~ ( s
& t ) )
& q ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( ~ ( ~ ( t
& s )
| ~ ( q
& ( ~ ( t
& s )
| ~ ( q
& p ) ) ) )
| ~ s
| ~ q
| ~ t )
=> ( ~ ( s
& t )
| ~ ( ( ~ ( q
& ( ~ ( q
& p )
| ~ ( s
& t ) ) )
| ~ ( s
& t ) )
& q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cDMG7) ).
tff(f20,plain,
q = $true,
inference(cnf_transformation,[],[f9]) ).
tff(f19,plain,
s = $true,
inference(cnf_transformation,[],[f9]) ).
tff(f11,plain,
( ( s != $true )
| ( q != $true )
| ( p = $true )
| ( t != $true ) ),
inference(cnf_transformation,[],[f9]) ).
tff(f32,plain,
p != $true,
inference(trivial_inequality_removal,[],[f31]) ).
tff(f31,plain,
( ( $true != $true )
| ( p != $true ) ),
inference(duplicate_literal_removal,[],[f21]) ).
tff(f21,plain,
( ( $true != $true )
| ( $true != $true )
| ( $true != $true )
| ( p != $true )
| ( $true != $true )
| ( $true != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f18,f20,f19,f10,f19,f10,f20]) ).
tff(f18,plain,
( ( q != $true )
| ( s != $true )
| ( t != $true )
| ( p != $true )
| ( s != $true )
| ( t != $true )
| ( q != $true ) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO089^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n010.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:37:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_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/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 % (27053)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.37 % (27054)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.13/0.37 % (27048)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.13/0.37 % (27054)First to succeed.
% 0.13/0.37 % (27052)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.13/0.37 % (27048)Also succeeded, but the first one will report.
% 0.13/0.37 % (27051)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.13/0.37 % (27054)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (27054)------------------------------
% 0.13/0.37 % (27054)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (27054)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (27054)Memory used [KB]: 5500
% 0.13/0.37 % (27054)Time elapsed: 0.003 s
% 0.13/0.37 % (27054)Instructions burned: 1 (million)
% 0.13/0.37 % (27054)------------------------------
% 0.13/0.37 % (27054)------------------------------
% 0.13/0.37 % (27046)Success in time 0.004 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------