↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYO334^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:49:44 AM UTC 2026

% Result   : Theorem 0.26s 0.32s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO334^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  % Computer : n005.cluster.edu
% 0.09/0.22  % Model    : x86_64 x86_64
% 0.09/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22  % Memory   : 8046.5625MB
% 0.09/0.22  % OS       : Linux 6.8.0-71-generic
% 0.09/0.22  % CPULimit : 300
% 0.09/0.22  % WCLimit  : 300
% 0.09/0.22  % DateTime : Tue Sep 29 16:46:16 UTC 2026
% 0.09/0.22  % CPUTime  : 
% 0.09/0.22  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.27  Running first-order model finding
% 0.09/0.27  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.26/0.32  % (1904418)Will run a generic schedule for satisfiability detection.
% 0.26/0.32  % (1904424)% WARNING: option uhcvi not known.
% 0.26/0.32  % (1904424)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3749983037:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.26/0.32  % (1904424)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.26/0.32  % (1904424)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 0.26/0.32  % (1904426)dis+10_1_sil=32000:sp=arity:random_seed=1842087361:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.26/0.32  % (1904427)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1559599881:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.26/0.32  % (1904428)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3289038004:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.26/0.32  % (1904423)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3198528242_3000 on theBenchmark for (3000ds/0Mi)
% 0.26/0.32  % (1904429)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4151534414:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.26/0.32  % (1904427)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.26/0.32  % (1904425)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=989351900:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.26/0.32  % (1904424) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1904418-1904424"...
% 0.26/0.32  % Exception at run slice level
% 0.26/0.32  User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.26/0.32  % (1904424)...printing done.
% 0.26/0.32  % (1904424)Refutation found. Thanks to Tanya!
% 0.26/0.32  % SZS status Theorem for theBenchmark
% 0.26/0.32  % SZS output start Proof for theBenchmark
% 0.26/0.32  thf(type_def_5, type, c: $tType).
% 0.26/0.32  thf(type_def_6, type, b: $tType).
% 0.26/0.32  thf(type_def_7, type, a: $tType).
% 0.26/0.32  thf(type_def_8, type, sTfun: ($tType * $tType) > $tType).
% 0.26/0.32  thf(func_def_0, type, c_starc: (c > c > c)).
% 0.26/0.32  thf(func_def_1, type, c_starb: (b > b > b)).
% 0.26/0.32  thf(func_def_2, type, c_stara: (a > a > a)).
% 0.26/0.32  thf(func_def_6, type, sK0: (a > b)).
% 0.26/0.32  thf(func_def_7, type, sK1: (a > c)).
% 0.26/0.32  thf(func_def_8, type, sK2: (b > c)).
% 0.26/0.32  thf(func_def_9, type, sK3: b).
% 0.26/0.32  thf(func_def_10, type, sK4: b).
% 0.26/0.32  thf(func_def_11, type, sK5: (c > $o)).
% 0.26/0.32  thf(func_def_12, type, sK6: (b > a)).
% 0.26/0.32  thf(func_def_13, type, vNOT: ($o > $o)).
% 0.26/0.32  thf(func_def_14, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.26/0.32  thf(func_def_15, type, db0: !>[X0: $tType]:(X0)).
% 0.26/0.32  thf(func_def_16, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.26/0.32  thf(f1,conjecture,(
% 0.26/0.32    ! [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : ((! [X3 : a,X5 : a,X4 : (c > $o)] : ((X4 @ (X1 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starc @ (X1 @ X3) @ (X1 @ X5)))) & ! [X3 : a,X5 : a,X4 : (b > $o)] : ((X4 @ (X0 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starb @ (X0 @ X3) @ (X0 @ X5)))) & ! [X5 : b] : ? [X3 : a] : ! [X4 : (b > $o)] : ((X4 @ (X0 @ X3)) => (X4 @ X5)) & ! [X3 : a,X4 : (c > $o)] : ((X4 @ (X2 @ (X0 @ X3))) => (X4 @ (X1 @ X3)))) => ! [X3 : b,X5 : b,X4 : (c > $o)] : ((X4 @ (X2 @ (c_starb @ X3 @ X5))) => (X4 @ (c_starc @ (X2 @ X3) @ (X2 @ X5)))))),
% 0.26/0.32    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM270_INST)).
% 0.26/0.32  thf(f2,negated_conjecture,(
% 0.26/0.32    ~ ! [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : ((! [X3 : a,X5 : a,X4 : (c > $o)] : ((X4 @ (X1 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starc @ (X1 @ X3) @ (X1 @ X5)))) & ! [X3 : a,X5 : a,X4 : (b > $o)] : ((X4 @ (X0 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starb @ (X0 @ X3) @ (X0 @ X5)))) & ! [X5 : b] : ? [X3 : a] : ! [X4 : (b > $o)] : ((X4 @ (X0 @ X3)) => (X4 @ X5)) & ! [X3 : a,X4 : (c > $o)] : ((X4 @ (X2 @ (X0 @ X3))) => (X4 @ (X1 @ X3)))) => ! [X3 : b,X5 : b,X4 : (c > $o)] : ((X4 @ (X2 @ (c_starb @ X3 @ X5))) => (X4 @ (c_starc @ (X2 @ X3) @ (X2 @ X5)))))),
% 0.26/0.32    inference(negated_conjecture,[status(cth)],[f1])).
% 0.26/0.32  thf(f3,plain,(
% 0.26/0.32    ~ ! [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : ((! [X3 : a,X4 : a,X5 : (c > $o)] : ((X5 @ (X1 @ (c_stara @ X3 @ X4))) => (X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4)))) & ! [X6 : a,X7 : a,X8 : (b > $o)] : ((X8 @ (X0 @ (c_stara @ X6 @ X7))) => (X8 @ (c_starb @ (X0 @ X6) @ (X0 @ X7)))) & ! [X9 : b] : ? [X10 : a] : ! [X11 : (b > $o)] : ((X11 @ (X0 @ X10)) => (X11 @ X9)) & ! [X12 : a,X13 : (c > $o)] : ((X13 @ (X2 @ (X0 @ X12))) => (X13 @ (X1 @ X12)))) => ! [X14 : b,X15 : b,X16 : (c > $o)] : ((X16 @ (X2 @ (c_starb @ X14 @ X15))) => (X16 @ (c_starc @ (X2 @ X14) @ (X2 @ X15)))))),
% 0.26/0.32    inference(rectify,[],[f2])).
% 0.26/0.32  thf(f4,plain,(
% 0.26/0.32    ~ ! [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : ((! [X3 : a,X4 : a,X5 : (c > $o)] : ((((X5 @ (X1 @ (c_stara @ X3 @ X4)))) = $true) => (((X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4)))) = $true)) & ! [X6 : a,X7 : a,X8 : (b > $o)] : ((((X8 @ (X0 @ (c_stara @ X6 @ X7)))) = $true) => (((X8 @ (c_starb @ (X0 @ X6) @ (X0 @ X7)))) = $true)) & ! [X9 : b] : ? [X10 : a] : ! [X11 : (b > $o)] : ((((X11 @ (X0 @ X10))) = $true) => (((X11 @ X9)) = $true)) & ! [X12 : a,X13 : (c > $o)] : ((((X13 @ (X2 @ (X0 @ X12)))) = $true) => (((X13 @ (X1 @ X12))) = $true))) => ! [X14 : b,X15 : b,X16 : (c > $o)] : ((((X16 @ (X2 @ (c_starb @ X14 @ X15)))) = $true) => (((X16 @ (c_starc @ (X2 @ X14) @ (X2 @ X15)))) = $true)))),
% 0.26/0.32    inference(fool_elimination,[],[f3])).
% 0.26/0.32  thf(f5,plain,(
% 0.26/0.32    ? [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : (? [X14 : b,X15 : b,X16 : (c > $o)] : ((((X16 @ (c_starc @ (X2 @ X14) @ (X2 @ X15)))) != $true) & (((X16 @ (X2 @ (c_starb @ X14 @ X15)))) = $true)) & (! [X3 : a,X4 : a,X5 : (c > $o)] : ((((X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4)))) = $true) | (((X5 @ (X1 @ (c_stara @ X3 @ X4)))) != $true)) & ! [X6 : a,X7 : a,X8 : (b > $o)] : ((((X8 @ (c_starb @ (X0 @ X6) @ (X0 @ X7)))) = $true) | (((X8 @ (X0 @ (c_stara @ X6 @ X7)))) != $true)) & ! [X9 : b] : ? [X10 : a] : ! [X11 : (b > $o)] : ((((X11 @ X9)) = $true) | (((X11 @ (X0 @ X10))) != $true)) & ! [X12 : a,X13 : (c > $o)] : ((((X13 @ (X1 @ X12))) = $true) | (((X13 @ (X2 @ (X0 @ X12)))) != $true))))),
% 0.26/0.32    inference(ennf_transformation,[],[f4])).
% 0.26/0.32  thf(f6,plain,(
% 0.26/0.32    ? [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : (? [X14 : b,X15 : b,X16 : (c > $o)] : ((((X16 @ (c_starc @ (X2 @ X14) @ (X2 @ X15)))) != $true) & (((X16 @ (X2 @ (c_starb @ X14 @ X15)))) = $true)) & ! [X3 : a,X4 : a,X5 : (c > $o)] : ((((X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4)))) = $true) | (((X5 @ (X1 @ (c_stara @ X3 @ X4)))) != $true)) & ! [X6 : a,X7 : a,X8 : (b > $o)] : ((((X8 @ (c_starb @ (X0 @ X6) @ (X0 @ X7)))) = $true) | (((X8 @ (X0 @ (c_stara @ X6 @ X7)))) != $true)) & ! [X9 : b] : ? [X10 : a] : ! [X11 : (b > $o)] : ((((X11 @ X9)) = $true) | (((X11 @ (X0 @ X10))) != $true)) & ! [X12 : a,X13 : (c > $o)] : ((((X13 @ (X1 @ X12))) = $true) | (((X13 @ (X2 @ (X0 @ X12)))) != $true)))),
% 0.26/0.32    inference(flattening,[],[f5])).
% 0.26/0.32  thf(f7,plain,(
% 0.26/0.32    ? [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : (? [X3 : b,X4 : b,X5 : (c > $o)] : (($true != ((X5 @ (c_starc @ (X2 @ X3) @ (X2 @ X4))))) & ($true = ((X5 @ (X2 @ (c_starb @ X3 @ X4)))))) & ! [X6 : a,X7 : a,X8 : (c > $o)] : (($true = ((X8 @ (c_starc @ (X1 @ X6) @ (X1 @ X7))))) | ($true != ((X8 @ (X1 @ (c_stara @ X6 @ X7)))))) & ! [X9 : a,X10 : a,X11 : (b > $o)] : (($true = ((X11 @ (c_starb @ (X0 @ X9) @ (X0 @ X10))))) | ($true != ((X11 @ (X0 @ (c_stara @ X9 @ X10)))))) & ! [X12 : b] : ? [X13 : a] : ! [X14 : (b > $o)] : (($true = ((X14 @ X12))) | ($true != ((X14 @ (X0 @ X13))))) & ! [X15 : a,X16 : (c > $o)] : (($true = ((X16 @ (X1 @ X15)))) | ($true != ((X16 @ (X2 @ (X0 @ X15)))))))),
% 0.26/0.32    inference(rectify,[],[f6])).
% 0.26/0.32  thf(f8,plain,(
% 0.26/0.32    (($true != ((sK5 @ (c_starc @ (sK2 @ sK3) @ (sK2 @ sK4))))) & ($true = ((sK5 @ (sK2 @ (c_starb @ sK3 @ sK4)))))) & ! [X6 : a,X7 : a,X8 : (c > $o)] : (($true = ((X8 @ (c_starc @ (sK1 @ X6) @ (sK1 @ X7))))) | ($true != ((X8 @ (sK1 @ (c_stara @ X6 @ X7)))))) & ! [X9 : a,X10 : a,X11 : (b > $o)] : (($true = ((X11 @ (c_starb @ (sK0 @ X9) @ (sK0 @ X10))))) | ($true != ((X11 @ (sK0 @ (c_stara @ X9 @ X10)))))) & ! [X12 : b] : ! [X14 : (b > $o)] : (($true = ((X14 @ X12))) | ($true != ((X14 @ (sK0 @ (sK6 @ X12)))))) & ! [X15 : a,X16 : (c > $o)] : (($true = ((X16 @ (sK1 @ X15)))) | ($true != ((X16 @ (sK2 @ (sK0 @ X15))))))),
% 0.26/0.32    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,vAPP]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X13,sK6 @ X12)],[f7])).
% 0.26/0.32  thf(f9,plain,(
% 0.26/0.32    ( ! [X16 : (c > $o),X15 : a] : (($true != ((X16 @ (sK2 @ (sK0 @ X15))))) | ($true = ((X16 @ (sK1 @ X15))))) )),
% 0.26/0.32    inference(cnf_transformation,[],[f8])).
% 0.26/0.32  thf(f10,plain,(
% 0.26/0.32    ( ! [X14 : (b > $o),X12 : b] : (($true != ((X14 @ (sK0 @ (sK6 @ X12))))) | ($true = ((X14 @ X12)))) )),
% 0.26/0.32    inference(cnf_transformation,[],[f8])).
% 0.26/0.32  thf(f11,plain,(
% 0.26/0.32    ( ! [X10 : a,X11 : (b > $o),X9 : a] : (($true != ((X11 @ (sK0 @ (c_stara @ X9 @ X10))))) | ($true = ((X11 @ (c_starb @ (sK0 @ X9) @ (sK0 @ X10)))))) )),
% 0.26/0.32    inference(cnf_transformation,[],[f8])).
% 0.26/0.32  thf(f12,plain,(
% 0.26/0.32    ( ! [X8 : (c > $o),X6 : a,X7 : a] : (($true != ((X8 @ (sK1 @ (c_stara @ X6 @ X7))))) | ($true = ((X8 @ (c_starc @ (sK1 @ X6) @ (sK1 @ X7)))))) )),
% 0.26/0.32    inference(cnf_transformation,[],[f8])).
% 0.26/0.32  thf(f13,plain,(
% 0.26/0.32    ($true = ((sK5 @ (sK2 @ (c_starb @ sK3 @ sK4)))))),
% 0.26/0.32    inference(cnf_transformation,[],[f8])).
% 0.26/0.32  thf(f14,plain,(
% 0.26/0.32    ($true != ((sK5 @ (c_starc @ (sK2 @ sK3) @ (sK2 @ sK4)))))),
% 0.26/0.32    inference(cnf_transformation,[],[f8])).
% 0.26/0.32  thf(f17,plain,(
% 0.26/0.32    ( ! [X0 : b] : ((((sK0 @ (sK6 @ X0))) = X0)) )),
% 0.26/0.32    inference(leibniz_equality_elimination,[],[f10])).
% 0.26/0.32  thf(f32,plain,(
% 0.26/0.32    ( ! [X0 : a] : ((((sK2 @ (sK0 @ X0))) = ((sK1 @ X0)))) )),
% 0.26/0.32    inference(leibniz_equality_elimination,[],[f9])).
% 0.26/0.32  thf(f47,plain,(
% 0.26/0.32    ( ! [X0 : a,X1 : a] : ((((sK0 @ (c_stara @ X0 @ X1))) = ((c_starb @ (sK0 @ X0) @ (sK0 @ X1))))) )),
% 0.26/0.32    inference(leibniz_equality_elimination,[],[f11])).
% 0.26/0.32  thf(f62,plain,(
% 0.26/0.32    ( ! [X0 : a,X1 : a] : ((((sK1 @ (c_stara @ X0 @ X1))) = ((c_starc @ (sK1 @ X0) @ (sK1 @ X1))))) )),
% 0.26/0.32    inference(leibniz_equality_elimination,[],[f12])).
% 0.26/0.32  thf(f79,plain,(
% 0.26/0.32    ( ! [X0 : b] : ((((sK2 @ X0)) = ((sK1 @ (sK6 @ X0))))) )),
% 0.26/0.32    inference(constrained_superposition,[],[f32,f17])).
% 0.26/0.32  thf(f121,plain,(
% 0.26/0.32    ( ! [X0 : b,X1 : a] : ((((sK0 @ (c_stara @ X1 @ (sK6 @ X0)))) = ((c_starb @ (sK0 @ X1) @ X0)))) )),
% 0.26/0.32    inference(constrained_superposition,[],[f47,f17])).
% 0.26/0.32  thf(f123,plain,(
% 0.26/0.32    ( ! [X0 : b,X1 : a] : ((((sK1 @ (c_stara @ X1 @ (sK6 @ X0)))) = ((c_starc @ (sK1 @ X1) @ (sK2 @ X0))))) )),
% 0.26/0.32    inference(constrained_superposition,[],[f62,f79])).
% 0.26/0.32  thf(f161,plain,(
% 0.26/0.32    ( ! [X0 : a,X1 : b] : ((((sK2 @ (c_starb @ (sK0 @ X0) @ X1))) = ((sK1 @ (c_stara @ X0 @ (sK6 @ X1)))))) )),
% 0.26/0.32    inference(constrained_superposition,[],[f32,f121])).
% 0.26/0.32  thf(f210,plain,(
% 0.26/0.32    ( ! [X0 : a,X1 : b] : ((((sK2 @ (c_starb @ (sK0 @ X0) @ X1))) = ((c_starc @ (sK1 @ X0) @ (sK2 @ X1))))) )),
% 0.26/0.32    inference(forward_demodulation,[],[f161,f123])).
% 0.26/0.32  thf(f217,plain,(
% 0.26/0.32    ( ! [X0 : b,X1 : b] : ((((sK2 @ (c_starb @ X0 @ X1))) = ((c_starc @ (sK1 @ (sK6 @ X0)) @ (sK2 @ X1))))) )),
% 0.26/0.32    inference(constrained_superposition,[],[f210,f17])).
% 0.26/0.32  thf(f224,plain,(
% 0.26/0.32    ( ! [X0 : b,X1 : b] : ((((sK2 @ (c_starb @ X0 @ X1))) = ((c_starc @ (sK2 @ X0) @ (sK2 @ X1))))) )),
% 0.26/0.32    inference(forward_demodulation,[],[f217,f79])).
% 0.26/0.32  thf(f231,plain,(
% 0.26/0.32    ($true != ((sK5 @ (sK2 @ (c_starb @ sK3 @ sK4)))))),
% 0.26/0.32    inference(constrained_superposition,[],[f14,f224])).
% 0.26/0.32  thf(f232,plain,(
% 0.26/0.32    $false),
% 0.26/0.32    inference(forward_subsumption_resolution,[],[f231,f13])).
% 0.26/0.32  % SZS output end Proof for theBenchmark
% 0.26/0.32  % (1904424)------------------------------
% 0.26/0.32  % (1904424)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.32  % (1904424)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.32  % (1904424)CaDiCaL version: 2.1.3
% 0.26/0.32  % (1904424)Termination reason: Refutation
% 0.26/0.32  % (1904424)Time elapsed: 0.016 s
% 0.26/0.32  % (1904424)Peak memory usage: 12 MB
% 0.26/0.32  % (1904424)Instructions burned: 30 (million)
% 0.26/0.32  % (1904418)Success in time 0.038 s
% 0.26/0.32  % Vampire exiting
%------------------------------------------------------------------------------