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

% Computer : n001.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 12:26:02 PM UTC 2026

% Result   : Theorem 0.10s 0.45s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM905_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36  % Computer : n001.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 21:44:47 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.10/0.45  % (3982506)Will run a generic schedule for satisfiability detection.
% 0.10/0.45  % (3982525)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2764264622:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45  % (3982522)% WARNING: option uhcvi not known.
% 0.10/0.45  % (3982522)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3827553908:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45  % (3982521)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3015807149_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45  % (3982524)dis+10_1_sil=32000:sp=arity:random_seed=2425548272:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45  % (3982523)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1471192036:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45  % (3982526)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3505582699:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45  % (3982521)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.10/0.45  % (3982521)Terminated due to inappropriate strategy.
% 0.10/0.45  % (3982521)------------------------------
% 0.10/0.45  % (3982521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45  % (3982521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45  % (3982521)CaDiCaL version: 2.1.3
% 0.10/0.45  % (3982521)Termination reason: Inappropriate
% 0.10/0.45  % (3982521)Time elapsed: 0.0000 s
% 0.10/0.45  % (3982521)Peak memory usage: 10 MB
% 0.10/0.45  % (3982527)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1952319768:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45  % (3982521)------------------------------
% 0.10/0.45  % (3982521)------------------------------
% 0.10/0.45  % (3982525) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3982506-3982525"...
% 0.10/0.45  % (3982525)...printing done.
% 0.10/0.45  % (3982525)Refutation found. Thanks to Tanya!
% 0.10/0.45  % SZS status Theorem for theBenchmark
% 0.10/0.45  % SZS output start Proof for theBenchmark
% 0.10/0.45  tff(func_def_4, type, sK0: $rat).
% 0.10/0.45  tff(f1,conjecture,(
% 0.10/0.46    ! [X0 : $rat] : (X0 = $uminus(X0) <=> X0 = 0/1)),
% 0.10/0.46    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_uminus_problem_9)).
% 0.10/0.46  tff(f2,negated_conjecture,(
% 0.10/0.46    ~ ! [X0 : $rat] : (X0 = $uminus(X0) <=> X0 = 0/1)),
% 0.10/0.46    inference(negated_conjecture,[status(cth)],[f1])).
% 0.10/0.46  tff(f3,definition,(
% 0.10/0.46    ( ! [X0 : $rat,X1 : $rat] : ($sum(X0,X1) = $sum(X1,X0)) )),
% 0.10/0.46    introduced(theory,[tha_commutativity])).
% 0.10/0.46  tff(f5,definition,(
% 0.10/0.46    ( ! [X0 : $rat] : ($sum(X0,0/1) = X0) )),
% 0.10/0.46    introduced(theory,[tha_right_identity])).
% 0.10/0.46  tff(f7,definition,(
% 0.10/0.46    ( ! [X0 : $rat] : (0/1 = $sum(X0,$uminus(X0))) )),
% 0.10/0.46    introduced(theory,[tha_inverse_op_unit])).
% 0.10/0.46  tff(f8,definition,(
% 0.10/0.46    ( ! [X0 : $rat] : (~$less(X0,X0)) )),
% 0.10/0.46    introduced(theory,[tha_non-reflexivity])).
% 0.10/0.46  tff(f9,definition,(
% 0.10/0.46    ( ! [X2 : $rat,X0 : $rat,X1 : $rat] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )),
% 0.10/0.46    introduced(theory,[tha_transitivity])).
% 0.10/0.46  tff(f10,definition,(
% 0.10/0.46    ( ! [X0 : $rat,X1 : $rat] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )),
% 0.10/0.46    introduced(theory,[tha_order_totality])).
% 0.10/0.46  tff(f11,definition,(
% 0.10/0.46    ( ! [X2 : $rat,X0 : $rat,X1 : $rat] : ($less($sum(X0,X2),$sum(X1,X2)) | ~$less(X0,X1)) )),
% 0.10/0.46    introduced(theory,[tha_order_monotonicity])).
% 0.10/0.46  tff(f14,plain,(
% 0.10/0.46    ? [X0 : $rat] : (X0 = $uminus(X0) <~> X0 = 0/1)),
% 0.10/0.46    inference(ennf_transformation,[],[f2])).
% 0.10/0.46  tff(f15,plain,(
% 0.10/0.46    0/1 = sK0 | sK0 = $uminus(sK0)),
% 0.10/0.46    inference(cnf_transformation,[],[f14])).
% 0.10/0.46  tff(f16,plain,(
% 0.10/0.46    0/1 != sK0 | sK0 != $uminus(sK0)),
% 0.10/0.46    inference(cnf_transformation,[],[f14])).
% 0.10/0.46  tff(f18,definition,(
% 0.10/0.46    spl1_1 <=> sK0 = $uminus(sK0)),
% 0.10/0.46    introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition])).
% 0.10/0.46  tff(f19,plain,(
% 0.10/0.46    sK0 != $uminus(sK0) | spl1_1),
% 0.10/0.46    inference(avatar_component_clause,[],[f18])).
% 0.10/0.46  tff(f20,plain,(
% 0.10/0.46    sK0 = $uminus(sK0) | ~spl1_1),
% 0.10/0.46    inference(avatar_component_clause,[],[f18])).
% 0.10/0.46  tff(f22,definition,(
% 0.10/0.46    spl1_2 <=> 0/1 = sK0),
% 0.10/0.46    introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition])).
% 0.10/0.46  tff(f23,plain,(
% 0.10/0.46    0/1 != sK0 | spl1_2),
% 0.10/0.46    inference(avatar_component_clause,[],[f22])).
% 0.10/0.46  tff(f24,plain,(
% 0.10/0.46    0/1 = sK0 | ~spl1_2),
% 0.10/0.46    inference(avatar_component_clause,[],[f22])).
% 0.10/0.46  tff(f25,plain,(
% 0.10/0.46    spl1_1 | spl1_2),
% 0.10/0.46    inference(avatar_split_clause,[],[f15,f22,f18])).
% 0.10/0.46  tff(f26,plain,(
% 0.10/0.46    ~spl1_1 | ~spl1_2),
% 0.10/0.46    inference(avatar_split_clause,[],[f16,f22,f18])).
% 0.10/0.46  tff(f27,plain,(
% 0.10/0.46    0/1 != $uminus(0/1) | (spl1_1 | ~spl1_2)),
% 0.10/0.46    inference(superposition,[],[f19,f24])).
% 0.10/0.46  tff(f28,plain,(
% 0.10/0.46    $false | (spl1_1 | ~spl1_2)),
% 0.10/0.46    inference(evaluation,[],[f27])).
% 0.10/0.46  tff(f29,plain,(
% 0.10/0.46    spl1_1 | ~spl1_2),
% 0.10/0.46    inference(avatar_contradiction_clause,[],[f28])).
% 0.10/0.46  tff(f31,plain,(
% 0.10/0.46    0/1 = $sum(sK0,sK0) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f7,f20])).
% 0.10/0.46  tff(f45,plain,(
% 0.10/0.46    ( ! [X0 : $rat,X1 : $rat] : (~$less(X0,X1) | ~$less(X1,X0)) )),
% 0.10/0.46    inference(resolution,[],[f9,f8])).
% 0.10/0.46  tff(f98,plain,(
% 0.10/0.46    ( ! [X0 : $rat] : ($less(0/1,$sum(X0,sK0)) | ~$less(sK0,X0)) ) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f11,f31])).
% 0.10/0.46  tff(f104,plain,(
% 0.10/0.46    ( ! [X0 : $rat] : ($less($sum(X0,sK0),0/1) | ~$less(X0,sK0)) ) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f11,f31])).
% 0.10/0.46  tff(f110,plain,(
% 0.10/0.46    ( ! [X0 : $rat] : ($less(0/1,$sum(sK0,X0)) | ~$less(sK0,X0)) ) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f98,f3])).
% 0.10/0.46  tff(f200,plain,(
% 0.10/0.46    ( ! [X0 : $rat] : ($less($sum(sK0,X0),0/1) | ~$less(X0,sK0)) ) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f104,f3])).
% 0.10/0.46  tff(f218,plain,(
% 0.10/0.46    $less(0/1,sK0) | ~$less(sK0,0/1) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f110,f5])).
% 0.10/0.46  tff(f225,plain,(
% 0.10/0.46    ~$less(sK0,0/1) | ~spl1_1),
% 0.10/0.46    inference(forward_subsumption_resolution,[],[f218,f45])).
% 0.10/0.46  tff(f261,plain,(
% 0.10/0.46    $less(0/1,sK0) | 0/1 = sK0 | ~spl1_1),
% 0.10/0.46    inference(resolution,[],[f225,f10])).
% 0.10/0.46  tff(f263,plain,(
% 0.10/0.46    $less(0/1,sK0) | (~spl1_1 | spl1_2)),
% 0.10/0.46    inference(forward_subsumption_resolution,[],[f261,f23])).
% 0.10/0.46  tff(f661,plain,(
% 0.10/0.46    $less(sK0,0/1) | ~$less(0/1,sK0) | ~spl1_1),
% 0.10/0.46    inference(superposition,[],[f200,f5])).
% 0.10/0.46  tff(f669,plain,(
% 0.10/0.46    ~$less(0/1,sK0) | ~spl1_1),
% 0.10/0.46    inference(forward_subsumption_resolution,[],[f661,f45])).
% 0.10/0.46  tff(f672,plain,(
% 0.10/0.46    $false | (~spl1_1 | spl1_2)),
% 0.10/0.46    inference(forward_subsumption_resolution,[],[f669,f263])).
% 0.10/0.46  tff(f673,plain,(
% 0.10/0.46    ~spl1_1 | spl1_2),
% 0.10/0.46    inference(avatar_contradiction_clause,[],[f672])).
% 0.10/0.46  cnf(s1, plain, spl1_1 | spl1_2, inference(sat_conversion,[],[f25])).
% 0.10/0.46  cnf(s2, plain, ~spl1_1 | ~spl1_2, inference(sat_conversion,[],[f26])).
% 0.10/0.46  cnf(s3, plain, spl1_1 | ~spl1_2, inference(sat_conversion,[],[f29])).
% 0.10/0.46  cnf(s4, plain, ~spl1_1 | spl1_2, inference(sat_conversion,[],[f673])).
% 0.10/0.46  cnf(s5, plain, spl1_1, inference(rat,[],[s1,s3])).
% 0.10/0.46  cnf(s6, plain, spl1_2, inference(rat,[],[s4,s5])).
% 0.10/0.46  cnf(s7, plain, $false, inference(rat,[],[s2,s6,s5])).
% 0.10/0.46  tff(f674,plain,(
% 0.10/0.46    $false),
% 0.10/0.46    inference(avatar_sat_refutation,[],[s7])).
% 0.10/0.46  % SZS output end Proof for theBenchmark
% 0.10/0.46  % (3982525)------------------------------
% 0.10/0.46  % (3982525)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46  % (3982525)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46  % (3982525)CaDiCaL version: 2.1.3
% 0.10/0.46  % (3982525)Termination reason: Refutation
% 0.10/0.46  % (3982525)Time elapsed: 0.011 s
% 0.10/0.46  % (3982525)Peak memory usage: 13 MB
% 0.10/0.46  % (3982525)Instructions burned: 25 (million)
% 0.10/0.46  % (3982506)Success in time 0.042 s
% 0.10/0.46  % Vampire exiting
%------------------------------------------------------------------------------