TSTP Solution File: SYO178^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO178^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 : n004.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:21 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 882 ( 216 equ)
% Maximal formula atoms : 58 ( 14 avg)
% Number of connectives : 612 ( 222 ~; 296 |; 85 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of FOOLs : 432 ( 432 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 23 ( 20 usr; 22 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(f88,plain,
$false,
inference(avatar_sat_refutation,[],[f52,f61,f66,f71,f72,f73,f74,f75,f80,f81,f82,f83,f84,f85,f86,f87]) ).
tff(f87,plain,
( ~ spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f31,f41,f45]) ).
tff(f45,plain,
( spl0_3
<=> ( cK = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
tff(f41,plain,
( spl0_2
<=> ( cM = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f31,plain,
( ( cK != $true )
| ( cM != $true ) ),
inference(trivial_inequality_removal,[],[f30]) ).
tff(f30,plain,
( ( $true != $true )
| ( cM != $true )
| ( cK != $true ) ),
inference(duplicate_literal_removal,[],[f27]) ).
tff(f27,plain,
( ( $true != $true )
| ( $true != $true )
| ( cM != $true )
| ( cK != $true ) ),
inference(definition_unfolding,[],[f15,f23,f22]) ).
tff(f22,plain,
cL = $true,
inference(cnf_transformation,[],[f6]) ).
tff(f6,plain,
( ( ( cM != $true )
| ( cK = $true )
| ( cN = $true )
| ( cG != $true )
| ( cE != $true ) )
& ( cE = $true )
& ( cL = $true )
& ( ( cM = $true )
| ( cG != $true )
| ( cR = $true ) )
& ( ( cM != $true )
| ( cK = $true )
| ( cF = $true )
| ( cN != $true ) )
& ( ( cC != $true )
| ( cR = $true )
| ( cG != $true )
| ( cB != $true ) )
& ( ( cC = $true )
| ( cB != $true )
| ( cK != $true ) )
& ( ( cR != $true )
| ( cE != $true )
| ( cC != $true ) )
& ( ( cR = $true )
| ( cP = $true )
| ( cG = $true ) )
& ( ( cK != $true )
| ( cE != $true )
| ( cL != $true )
| ( cM != $true ) )
& ( ( cL != $true )
| ( cM = $true )
| ( cP != $true ) )
& ( ( cC = $true )
| ( cM != $true )
| ( cL != $true ) )
& ( ( cC = $true )
| ( cN != $true )
| ( cF = $true )
| ( cP = $true ) )
& ( ( cF = $true )
| ( cR != $true )
| ( cN = $true )
| ( cP = $true ) )
& ( ( cB = $true )
| ( cF != $true ) )
& ( ( cG = $true )
| ( cK = $true )
| ( cR = $true ) )
& ( ( cK = $true )
| ( cG != $true )
| ( cB != $true )
| ( cM = $true ) )
& ( ( cG = $true )
| ( cM = $true )
| ( cR != $true )
| ( cK = $true ) ) ),
inference(flattening,[],[f5]) ).
tff(f5,plain,
~ ~ ( ( ( cL != $true )
| ( cM = $true )
| ( cP != $true ) )
& ( ( cR != $true )
| ( cG = $true )
| ( cM = $true )
| ( cK = $true ) )
& ( ( cR = $true )
| ( cP = $true )
| ( cG = $true ) )
& ( ( cB = $true )
| ( cF != $true ) )
& ( ( cR != $true )
| ( cP = $true )
| ( cF = $true )
| ( cN = $true ) )
& ( ( cM != $true )
| ( cL != $true )
| ( cC = $true ) )
& ( cL = $true )
& ( ( cB != $true )
| ( cC != $true )
| ( cG != $true )
| ( cR = $true ) )
& ( cE = $true )
& ( ( cC != $true )
| ( cE != $true )
| ( cR != $true ) )
& ( ( cR = $true )
| ( cM = $true )
| ( cG != $true ) )
& ( ( cM = $true )
| ( cK = $true )
| ( cB != $true )
| ( cG != $true ) )
& ( ( cK != $true )
| ( cB != $true )
| ( cC = $true ) )
& ( ( cN != $true )
| ( cP = $true )
| ( cF = $true )
| ( cC = $true ) )
& ( ( cE != $true )
| ( cM != $true )
| ( cK = $true )
| ( cN = $true )
| ( cG != $true ) )
& ( ( cM != $true )
| ( cK = $true )
| ( cN != $true )
| ( cF = $true ) )
& ( ( cG = $true )
| ( cK = $true )
| ( cR = $true ) )
& ( ( cE != $true )
| ( cL != $true )
| ( cK != $true )
| ( cM != $true ) ) ),
inference(fool_elimination,[],[f4]) ).
tff(f4,plain,
~ ~ ( ( ~ cL
| cM
| ~ cP )
& ( ~ cR
| cG
| cM
| cK )
& ( cP
| cR
| cG )
& ( cB
| ~ cF )
& ( ~ cR
| cP
| cF
| cN )
& ( ~ cM
| ~ cL
| cC )
& cL
& ( ~ cB
| ~ cC
| ~ cG
| cR )
& cE
& ( ~ cC
| ~ cE
| ~ cR )
& ( cR
| cM
| ~ cG )
& ( cM
| cK
| ~ cB
| ~ cG )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cE
| ~ cM
| cK
| cN
| ~ cG )
& ( ~ cM
| cK
| ~ cN
| cF )
& ( cK
| cG
| cR )
& ( ~ cE
| ~ cL
| ~ cK
| ~ cM ) ),
inference(rectify,[],[f2]) ).
tff(f2,negated_conjecture,
~ ~ ( ( ~ cL
| cM
| ~ cP )
& ( ~ cR
| cG
| cM
| cK )
& ( cP
| cR
| cG )
& ( cB
| ~ cF )
& ( ~ cR
| cP
| cF
| cN )
& ( ~ cM
| ~ cL
| cC )
& cL
& ( ~ cB
| ~ cC
| ~ cG
| cR )
& cE
& ( ~ cC
| ~ cE
| ~ cR )
& ( cR
| cM
| ~ cG )
& ( cM
| cK
| ~ cB
| ~ cG )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cE
| ~ cM
| cK
| cN
| ~ cG )
& ( ~ cM
| cK
| ~ cN
| cF )
& ( cK
| cG
| cR )
& ( ~ cE
| ~ cL
| ~ cK
| ~ cM ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
~ ( ( ~ cL
| cM
| ~ cP )
& ( ~ cR
| cG
| cM
| cK )
& ( cP
| cR
| cG )
& ( cB
| ~ cF )
& ( ~ cR
| cP
| cF
| cN )
& ( ~ cM
| ~ cL
| cC )
& cL
& ( ~ cB
| ~ cC
| ~ cG
| cR )
& cE
& ( ~ cC
| ~ cE
| ~ cR )
& ( cR
| cM
| ~ cG )
& ( cM
| cK
| ~ cB
| ~ cG )
& ( ~ cK
| ~ cB
| cC )
& ( ~ cN
| cP
| cF
| cC )
& ( ~ cE
| ~ cM
| cK
| cN
| ~ cG )
& ( ~ cM
| cK
| ~ cN
| cF )
& ( cK
| cG
| cR )
& ( ~ cE
| ~ cL
| ~ cK
| ~ cM ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPORKCHOP1C) ).
tff(f23,plain,
cE = $true,
inference(cnf_transformation,[],[f6]) ).
tff(f15,plain,
( ( cK != $true )
| ( cE != $true )
| ( cL != $true )
| ( cM != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f86,plain,
( ~ spl0_4
| spl0_9 ),
inference(avatar_split_clause,[],[f10,f77,f49]) ).
tff(f49,plain,
( spl0_4
<=> ( cF = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
tff(f77,plain,
( spl0_9
<=> ( cB = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
tff(f10,plain,
( ( cB = $true )
| ( cF != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f85,plain,
( spl0_8
| ~ spl0_1
| spl0_7
| spl0_4 ),
inference(avatar_split_clause,[],[f12,f49,f63,f37,f68]) ).
tff(f68,plain,
( spl0_8
<=> ( cC = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
tff(f37,plain,
( spl0_1
<=> ( cN = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f63,plain,
( spl0_7
<=> ( cP = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
tff(f12,plain,
( ( cF = $true )
| ( cC = $true )
| ( cN != $true )
| ( cP = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f84,plain,
( ~ spl0_5
| spl0_1
| spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f32,f41,f45,f37,f54]) ).
tff(f54,plain,
( spl0_5
<=> ( cG = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
tff(f32,plain,
( ( cG != $true )
| ( cK = $true )
| ( cN = $true )
| ( cM != $true ) ),
inference(trivial_inequality_removal,[],[f25]) ).
tff(f25,plain,
( ( $true != $true )
| ( cG != $true )
| ( cN = $true )
| ( cM != $true )
| ( cK = $true ) ),
inference(definition_unfolding,[],[f24,f23]) ).
tff(f24,plain,
( ( cM != $true )
| ( cK = $true )
| ( cN = $true )
| ( cG != $true )
| ( cE != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f83,plain,
( ~ spl0_6
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f33,f68,f58]) ).
tff(f58,plain,
( spl0_6
<=> ( cR = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
tff(f33,plain,
( ( cR != $true )
| ( cC != $true ) ),
inference(trivial_inequality_removal,[],[f26]) ).
tff(f26,plain,
( ( cR != $true )
| ( $true != $true )
| ( cC != $true ) ),
inference(definition_unfolding,[],[f17,f23]) ).
tff(f17,plain,
( ( cR != $true )
| ( cE != $true )
| ( cC != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f82,plain,
( ~ spl0_8
| ~ spl0_5
| ~ spl0_9
| spl0_6 ),
inference(avatar_split_clause,[],[f19,f58,f77,f54,f68]) ).
tff(f19,plain,
( ( cG != $true )
| ( cC != $true )
| ( cR = $true )
| ( cB != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f81,plain,
( ~ spl0_3
| spl0_8
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f18,f77,f68,f45]) ).
tff(f18,plain,
( ( cK != $true )
| ( cC = $true )
| ( cB != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f80,plain,
( spl0_3
| spl0_2
| ~ spl0_5
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f8,f77,f54,f41,f45]) ).
tff(f8,plain,
( ( cB != $true )
| ( cG != $true )
| ( cM = $true )
| ( cK = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f75,plain,
( spl0_2
| spl0_6
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f21,f54,f58,f41]) ).
tff(f21,plain,
( ( cG != $true )
| ( cM = $true )
| ( cR = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f74,plain,
( spl0_7
| ~ spl0_6
| spl0_4
| spl0_1 ),
inference(avatar_split_clause,[],[f11,f37,f49,f58,f63]) ).
tff(f11,plain,
( ( cR != $true )
| ( cN = $true )
| ( cF = $true )
| ( cP = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f73,plain,
( spl0_6
| spl0_5
| spl0_3 ),
inference(avatar_split_clause,[],[f9,f45,f54,f58]) ).
tff(f9,plain,
( ( cR = $true )
| ( cG = $true )
| ( cK = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f72,plain,
( spl0_7
| spl0_6
| spl0_5 ),
inference(avatar_split_clause,[],[f16,f54,f58,f63]) ).
tff(f16,plain,
( ( cR = $true )
| ( cG = $true )
| ( cP = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f71,plain,
( spl0_8
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f34,f41,f68]) ).
tff(f34,plain,
( ( cC = $true )
| ( cM != $true ) ),
inference(trivial_inequality_removal,[],[f29]) ).
tff(f29,plain,
( ( cC = $true )
| ( cM != $true )
| ( $true != $true ) ),
inference(definition_unfolding,[],[f13,f22]) ).
tff(f13,plain,
( ( cC = $true )
| ( cM != $true )
| ( cL != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f66,plain,
( ~ spl0_7
| spl0_2 ),
inference(avatar_split_clause,[],[f35,f41,f63]) ).
tff(f35,plain,
( ( cM = $true )
| ( cP != $true ) ),
inference(trivial_inequality_removal,[],[f28]) ).
tff(f28,plain,
( ( $true != $true )
| ( cM = $true )
| ( cP != $true ) ),
inference(definition_unfolding,[],[f14,f22]) ).
tff(f14,plain,
( ( cL != $true )
| ( cM = $true )
| ( cP != $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f61,plain,
( spl0_2
| spl0_3
| spl0_5
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f7,f58,f54,f45,f41]) ).
tff(f7,plain,
( ( cR != $true )
| ( cG = $true )
| ( cM = $true )
| ( cK = $true ) ),
inference(cnf_transformation,[],[f6]) ).
tff(f52,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f20,f49,f45,f41,f37]) ).
tff(f20,plain,
( ( cK = $true )
| ( cF = $true )
| ( cM != $true )
| ( cN != $true ) ),
inference(cnf_transformation,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO178^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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.37 % Computer : n004.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Mon May 20 08:46:53 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 This is a TH0_THM_NEQ_NAR problem
% 0.14/0.38 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.39 % (11759)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.14/0.39 % (11760)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.39 % (11761)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.40 % (11762)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.40 % (11763)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.14/0.40 % (11764)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.40 % (11765)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.40 % (11766)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.14/0.40 % (11762)Instruction limit reached!
% 0.14/0.40 % (11762)------------------------------
% 0.14/0.40 % (11762)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (11762)Termination reason: Unknown
% 0.14/0.40 % (11762)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (11763)Instruction limit reached!
% 0.14/0.40 % (11763)------------------------------
% 0.14/0.40 % (11763)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (11763)Termination reason: Unknown
% 0.14/0.40 % (11763)Termination phase: Saturation
% 0.14/0.40
% 0.14/0.40 % (11763)Memory used [KB]: 1023
% 0.14/0.40 % (11763)Time elapsed: 0.003 s
% 0.14/0.40 % (11763)Instructions burned: 2 (million)
% 0.14/0.40 % (11763)------------------------------
% 0.14/0.40 % (11763)------------------------------
% 0.14/0.40 % (11762)Memory used [KB]: 1023
% 0.14/0.40 % (11762)Time elapsed: 0.003 s
% 0.14/0.40 % (11762)Instructions burned: 2 (million)
% 0.14/0.40 % (11762)------------------------------
% 0.14/0.40 % (11762)------------------------------
% 0.14/0.40 % (11760)First to succeed.
% 0.14/0.40 % (11764)Also succeeded, but the first one will report.
% 0.14/0.40 % (11759)Also succeeded, but the first one will report.
% 0.14/0.40 % (11760)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (11760)------------------------------
% 0.14/0.40 % (11760)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (11760)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (11760)Memory used [KB]: 5500
% 0.14/0.40 % (11760)Time elapsed: 0.005 s
% 0.14/0.40 % (11760)Instructions burned: 2 (million)
% 0.14/0.40 % (11760)------------------------------
% 0.14/0.40 % (11760)------------------------------
% 0.14/0.40 % (11758)Success in time 0.017 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------