↑ 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  : SYO091_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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 : Tue Sep 29 02:29:49 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO091_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n004.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 17:26:52 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21  Running first-order model finding
% 0.09/0.21  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.18/0.26  % (541850)Will run a generic schedule for satisfiability detection.
% 0.18/0.26  % (541855)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=671971300_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.26  % Detected minimum model sizes of [1]
% 0.18/0.26  % Detected maximum model sizes of [5]
% 0.18/0.26  % TRYING [1]
% 0.18/0.26  % TRYING [2]
% 0.18/0.26  % TRYING [3]
% 0.18/0.26  % TRYING [4]
% 0.18/0.26  % TRYING [5]
% 0.18/0.26  % (541855) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-541850-541855"...
% 0.18/0.26  % (541855)...printing done.
% 0.18/0.26  % (541856)% WARNING: option uhcvi not known.
% 0.18/0.26  % (541857)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2964396635:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.26  % (541858)dis+10_1_sil=32000:sp=arity:random_seed=1884336763:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.26  % (541856)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2300139521:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.26  % (541859)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=654609167:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.26  % (541855)Refutation found. Thanks to Tanya!
% 0.18/0.26  % SZS status Theorem for theBenchmark
% 0.18/0.26  % SZS output start Proof for theBenchmark
% 0.18/0.26  tff(func_def_2, type, sK0: $o).
% 0.18/0.26  tff(func_def_3, type, sK1: $o).
% 0.18/0.26  tff(func_def_4, type, sK2: $o).
% 0.18/0.26  tff(pred_def_3, type, sP5: $o > $o).
% 0.18/0.26  tff(pred_def_7, type, sP9: $o > $o).
% 0.18/0.26  tff(pred_def_11, type, sP13: $o > $o).
% 0.18/0.26  tff(pred_def_15, type, sP17: $o > $o).
% 0.18/0.26  tff(pred_def_17, type, sP19: $o > $o).
% 0.18/0.26  tff(pred_def_19, type, sP21: $o > $o).
% 0.18/0.26  tff(pred_def_21, type, sP23: $o > $o).
% 0.18/0.26  tff(pred_def_25, type, sP27: $o > $o).
% 0.18/0.26  tff(pred_def_29, type, sP31: $o > $o).
% 0.18/0.26  tff(f1,conjecture,(
% 0.18/0.26    ! [X0 : $o,X1 : $o,X2 : $o] : (((X0 <=> X1) <=> X2) <=> (X0 <=> (X1 <=> X2)))),
% 0.18/0.26    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM50Q)).
% 0.18/0.26  tff(f2,negated_conjecture,(
% 0.18/0.26    ~ ! [X0 : $o,X1 : $o,X2 : $o] : (((X0 <=> X1) <=> X2) <=> (X0 <=> (X1 <=> X2)))),
% 0.18/0.26    inference(negated_conjecture,[status(cth)],[f1])).
% 0.18/0.26  tff(f3,plain,(
% 0.18/0.26    ~ ! [X0 : $o,X1 : $o,X2 : $o] : (((X0 <=> X1) <=> X2) <=> (X0 <=> (X1 <=> X2)))),
% 0.18/0.26    inference(rectify,[],[f2])).
% 0.18/0.26  tff(f4,plain,(
% 0.18/0.26    ~ ! [X0 : $o,X1 : $o,X2 : $o] : (((X0 = X1) <=> ($true = X2)) <=> (($true = X0) <=> (X1 = X2)))),
% 0.18/0.26    inference(fool_elimination,[],[f3])).
% 0.18/0.26  tff(f5,plain,(
% 0.18/0.26    ? [X0 : $o,X1 : $o,X2 : $o] : (((X0 = X1) <=> ($true = X2)) <~> (($true = X0) <=> (X1 = X2)))),
% 0.18/0.26    inference(ennf_transformation,[],[f4])).
% 0.18/0.26  tff(f6,plain,(
% 0.18/0.26    ? [X0 : $o,X1 : $o,X2 : $o] : (((((X1 != X2) | ($true != X0)) & ((X1 = X2) | ($true = X0))) | ((($true != X2) | (X0 != X1)) & (($true = X2) | (X0 = X1)))) & (((($true = X0) | (X1 != X2)) & ((X1 = X2) | ($true != X0))) | (((X0 = X1) | ($true != X2)) & (($true = X2) | (X0 != X1)))))),
% 0.18/0.26    inference(nnf_transformation,[],[f5])).
% 0.18/0.26  tff(f7,plain,(
% 0.18/0.26    ((((sK1 != sK2) | ($true != sK0)) & ((sK1 = sK2) | ($true = sK0))) | ((($true != sK2) | (sK0 != sK1)) & (($true = sK2) | (sK0 = sK1)))) & (((($true = sK0) | (sK1 != sK2)) & ((sK1 = sK2) | ($true != sK0))) | (((sK0 = sK1) | ($true != sK2)) & (($true = sK2) | (sK0 != sK1))))),
% 0.18/0.26    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f6])).
% 0.18/0.26  tff(f8,plain,(
% 0.18/0.26    (sK1 = sK2) | ($true != sK0) | ($true = sK2) | (sK0 != sK1)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f9,plain,(
% 0.18/0.26    (sK1 = sK2) | ($true != sK0) | (sK0 = sK1) | ($true != sK2)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f10,plain,(
% 0.18/0.26    ($true = sK0) | (sK1 != sK2) | ($true = sK2) | (sK0 != sK1)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f11,plain,(
% 0.18/0.26    ($true = sK0) | (sK1 != sK2) | (sK0 = sK1) | ($true != sK2)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f12,plain,(
% 0.18/0.26    (sK1 = sK2) | ($true = sK0) | ($true = sK2) | (sK0 = sK1)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f13,plain,(
% 0.18/0.26    (sK1 = sK2) | ($true = sK0) | ($true != sK2) | (sK0 != sK1)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f14,plain,(
% 0.18/0.26    (sK1 != sK2) | ($true != sK0) | ($true = sK2) | (sK0 = sK1)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f15,plain,(
% 0.18/0.26    (sK1 != sK2) | ($true != sK0) | ($true != sK2) | (sK0 != sK1)),
% 0.18/0.26    inference(cnf_transformation,[],[f7])).
% 0.18/0.26  tff(f16,definition,(
% 0.18/0.26    ($true != $false)),
% 0.18/0.26    introduced(theory,[fool_distinctness_axiom])).
% 0.18/0.26  tff(f17,definition,(
% 0.18/0.26    ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.18/0.26    introduced(theory,[fool_exhaustiveness_axiom])).
% 0.18/0.26  tff(f93,plain,(
% 0.18/0.26    $false),
% 0.18/0.26    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f17,f16,f15,f14,f13,f12,f11,f10,f9,f8])).
% 0.18/0.26  % SZS output end Proof for theBenchmark
% 0.18/0.26  % (541855)------------------------------
% 0.18/0.26  % (541855)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.26  % (541855)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.26  % (541855)CaDiCaL version: 2.1.3
% 0.18/0.26  % (541855)Termination reason: Refutation
% 0.18/0.26  % (541855)Time elapsed: 0.002 s
% 0.18/0.26  % (541855)Peak memory usage: 11 MB
% 0.18/0.26  % (541855)Instructions burned: 5 (million)
% 0.18/0.26  % (541850)Success in time 0.036 s
% 0.18/0.26  % Vampire exiting
%------------------------------------------------------------------------------