TSTP Solution File: SYO102^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SYO102^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 : n009.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:56 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYO102^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.14/0.35  % Computer : n009.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 09:24:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TH0_THM_NEQ_NAR problem
% 0.14/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.14/0.37  % (1755)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.37  % (1758)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.37  % (1759)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37  % (1760)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.37  % (1757)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.37  % (1761)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.37  % (1762)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.37  % (1763)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.37  % (1760)Instruction limit reached!
% 0.14/0.37  % (1760)------------------------------
% 0.14/0.37  % (1760)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (1760)Termination reason: Unknown
% 0.14/0.37  % (1760)Termination phase: Property scanning
% 0.14/0.37  
% 0.14/0.37  % (1760)Memory used [KB]: 895
% 0.14/0.37  % (1760)Time elapsed: 0.003 s
% 0.14/0.37  % (1760)Instructions burned: 2 (million)
% 0.14/0.37  % (1760)------------------------------
% 0.14/0.37  % (1760)------------------------------
% 0.14/0.37  % (1759)Instruction limit reached!
% 0.14/0.37  % (1759)------------------------------
% 0.14/0.37  % (1759)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (1759)Termination reason: Unknown
% 0.14/0.37  % (1759)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (1759)Memory used [KB]: 5500
% 0.14/0.37  % (1759)Time elapsed: 0.004 s
% 0.14/0.37  % (1759)Instructions burned: 2 (million)
% 0.14/0.37  % (1759)------------------------------
% 0.14/0.37  % (1759)------------------------------
% 0.14/0.37  % (1763)Instruction limit reached!
% 0.14/0.37  % (1763)------------------------------
% 0.14/0.37  % (1763)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (1763)Termination reason: Unknown
% 0.14/0.37  % (1763)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (1763)Memory used [KB]: 5500
% 0.14/0.37  % (1763)Time elapsed: 0.005 s
% 0.14/0.37  % (1763)Instructions burned: 3 (million)
% 0.14/0.37  % (1755)First to succeed.
% 0.14/0.37  % (1763)------------------------------
% 0.14/0.37  % (1763)------------------------------
% 0.14/0.37  % (1757)Instruction limit reached!
% 0.14/0.37  % (1757)------------------------------
% 0.14/0.37  % (1757)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37  % (1757)Termination reason: Unknown
% 0.14/0.37  % (1757)Termination phase: Saturation
% 0.14/0.37  
% 0.14/0.37  % (1757)Memory used [KB]: 5500
% 0.14/0.38  % (1757)Time elapsed: 0.005 s
% 0.14/0.38  % (1757)Instructions burned: 4 (million)
% 0.14/0.38  % (1757)------------------------------
% 0.14/0.38  % (1757)------------------------------
% 0.14/0.38  % (1761)Also succeeded, but the first one will report.
% 0.14/0.38  % (1755)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% 0.14/0.38  thf(func_def_0, type, cP: $i > $i > $o).
% 0.14/0.38  thf(f32,plain,(
% 0.14/0.38    $false),
% 0.14/0.38    inference(subsumption_resolution,[],[f30,f12])).
% 0.14/0.38  thf(f12,plain,(
% 0.14/0.38    ((cP @ sK0 @ sK1) = $true)),
% 0.14/0.38    inference(cnf_transformation,[],[f10])).
% 0.14/0.38  thf(f10,plain,(
% 0.14/0.38    ! [X0,X1,X2] : (((cP @ X0 @ X2) = $true) | ((cP @ X2 @ X1) != $true) | ((cP @ X0 @ X1) != $true)) & (((cP @ sK2 @ sK1) != $true) & ((cP @ sK2 @ sK0) = $true) & ((cP @ sK0 @ sK1) = $true)) & ! [X6] : ((cP @ X6 @ X6) = $true)),
% 0.14/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9])).
% 0.14/0.38  thf(f9,plain,(
% 0.14/0.38    ? [X3,X4,X5] : (((cP @ X5 @ X4) != $true) & ((cP @ X5 @ X3) = $true) & ((cP @ X3 @ X4) = $true)) => (((cP @ sK2 @ sK1) != $true) & ((cP @ sK2 @ sK0) = $true) & ((cP @ sK0 @ sK1) = $true))),
% 0.14/0.38    introduced(choice_axiom,[])).
% 0.14/0.38  thf(f8,plain,(
% 0.14/0.38    ! [X0,X1,X2] : (((cP @ X0 @ X2) = $true) | ((cP @ X2 @ X1) != $true) | ((cP @ X0 @ X1) != $true)) & ? [X3,X4,X5] : (((cP @ X5 @ X4) != $true) & ((cP @ X5 @ X3) = $true) & ((cP @ X3 @ X4) = $true)) & ! [X6] : ((cP @ X6 @ X6) = $true)),
% 0.14/0.38    inference(rectify,[],[f7])).
% 0.14/0.38  thf(f7,plain,(
% 0.14/0.38    ! [X1,X3,X2] : (((cP @ X1 @ X2) = $true) | ((cP @ X2 @ X3) != $true) | ((cP @ X1 @ X3) != $true)) & ? [X5,X4,X6] : (((cP @ X6 @ X4) != $true) & ((cP @ X6 @ X5) = $true) & ((cP @ X5 @ X4) = $true)) & ! [X0] : ((cP @ X0 @ X0) = $true)),
% 0.14/0.38    inference(flattening,[],[f6])).
% 0.14/0.38  thf(f6,plain,(
% 0.14/0.38    ? [X5,X4,X6] : (((cP @ X6 @ X4) != $true) & (((cP @ X5 @ X4) = $true) & ((cP @ X6 @ X5) = $true))) & (! [X2,X3,X1] : (((cP @ X1 @ X2) = $true) | (((cP @ X1 @ X3) != $true) | ((cP @ X2 @ X3) != $true))) & ! [X0] : ((cP @ X0 @ X0) = $true))),
% 0.14/0.38    inference(ennf_transformation,[],[f5])).
% 0.14/0.38  thf(f5,plain,(
% 0.14/0.38    ~((! [X2,X3,X1] : ((((cP @ X1 @ X3) = $true) & ((cP @ X2 @ X3) = $true)) => ((cP @ X1 @ X2) = $true)) & ! [X0] : ((cP @ X0 @ X0) = $true)) => ! [X5,X4,X6] : ((((cP @ X5 @ X4) = $true) & ((cP @ X6 @ X5) = $true)) => ((cP @ X6 @ X4) = $true)))),
% 0.14/0.38    inference(fool_elimination,[],[f4])).
% 0.14/0.38  thf(f4,plain,(
% 0.14/0.38    ~((! [X0] : (cP @ X0 @ X0) & ! [X1,X2,X3] : (((cP @ X2 @ X3) & (cP @ X1 @ X3)) => (cP @ X1 @ X2))) => ! [X4,X5,X6] : (((cP @ X6 @ X5) & (cP @ X5 @ X4)) => (cP @ X6 @ X4)))),
% 0.14/0.38    inference(rectify,[],[f2])).
% 0.14/0.38  thf(f2,negated_conjecture,(
% 0.14/0.38    ~((! [X0] : (cP @ X0 @ X0) & ! [X0,X2,X1] : (((cP @ X2 @ X1) & (cP @ X0 @ X1)) => (cP @ X0 @ X2))) => ! [X5,X4,X3] : (((cP @ X3 @ X4) & (cP @ X4 @ X5)) => (cP @ X3 @ X5)))),
% 0.14/0.38    inference(negated_conjecture,[],[f1])).
% 0.14/0.38  thf(f1,conjecture,(
% 0.14/0.38    (! [X0] : (cP @ X0 @ X0) & ! [X0,X2,X1] : (((cP @ X2 @ X1) & (cP @ X0 @ X1)) => (cP @ X0 @ X2))) => ! [X5,X4,X3] : (((cP @ X3 @ X4) & (cP @ X4 @ X5)) => (cP @ X3 @ X5))),
% 0.14/0.38    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM101)).
% 0.14/0.38  thf(f30,plain,(
% 0.14/0.38    ((cP @ sK0 @ sK1) != $true)),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f28])).
% 0.14/0.38  thf(f28,plain,(
% 0.14/0.38    ((cP @ sK0 @ sK1) != $true) | ($true != $true)),
% 0.14/0.38    inference(superposition,[],[f27,f11])).
% 0.14/0.38  thf(f11,plain,(
% 0.14/0.38    ( ! [X6 : $i] : (((cP @ X6 @ X6) = $true)) )),
% 0.14/0.38    inference(cnf_transformation,[],[f10])).
% 0.14/0.38  thf(f27,plain,(
% 0.14/0.38    ( ! [X0 : $i] : (((cP @ sK1 @ X0) != $true) | ((cP @ sK0 @ X0) != $true)) )),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f26])).
% 0.14/0.38  thf(f26,plain,(
% 0.14/0.38    ( ! [X0 : $i] : (((cP @ sK1 @ X0) != $true) | ((cP @ sK0 @ X0) != $true) | ($true != $true)) )),
% 0.14/0.38    inference(superposition,[],[f23,f15])).
% 0.14/0.38  thf(f15,plain,(
% 0.14/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((cP @ X0 @ X2) = $true) | ((cP @ X2 @ X1) != $true) | ((cP @ X0 @ X1) != $true)) )),
% 0.14/0.38    inference(cnf_transformation,[],[f10])).
% 0.14/0.38  thf(f23,plain,(
% 0.14/0.38    ((cP @ sK1 @ sK0) != $true)),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f18])).
% 0.14/0.38  thf(f18,plain,(
% 0.14/0.38    ($true != $true) | ((cP @ sK1 @ sK0) != $true)),
% 0.14/0.38    inference(superposition,[],[f17,f13])).
% 0.14/0.38  thf(f13,plain,(
% 0.14/0.38    ((cP @ sK2 @ sK0) = $true)),
% 0.14/0.38    inference(cnf_transformation,[],[f10])).
% 0.14/0.38  thf(f17,plain,(
% 0.14/0.38    ( ! [X0 : $i] : (((cP @ sK2 @ X0) != $true) | ((cP @ sK1 @ X0) != $true)) )),
% 0.14/0.38    inference(trivial_inequality_removal,[],[f16])).
% 0.14/0.38  thf(f16,plain,(
% 0.14/0.38    ( ! [X0 : $i] : (((cP @ sK1 @ X0) != $true) | ($true != $true) | ((cP @ sK2 @ X0) != $true)) )),
% 0.14/0.38    inference(superposition,[],[f14,f15])).
% 0.14/0.38  thf(f14,plain,(
% 0.14/0.38    ((cP @ sK2 @ sK1) != $true)),
% 0.14/0.38    inference(cnf_transformation,[],[f10])).
% 0.14/0.38  % SZS output end Proof for theBenchmark
% 0.14/0.38  % (1755)------------------------------
% 0.14/0.38  % (1755)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38  % (1755)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (1755)Memory used [KB]: 5500
% 0.14/0.38  % (1755)Time elapsed: 0.006 s
% 0.14/0.38  % (1755)Instructions burned: 3 (million)
% 0.14/0.38  % (1755)------------------------------
% 0.14/0.38  % (1755)------------------------------
% 0.14/0.38  % (1754)Success in time 0.004 s
% 0.14/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------