↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : ALG439-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 09:30:33 AM UTC 2026

% Result   : Unsatisfiable 0.23s 0.29s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   28 (   6 unt;   2 def)
%            Number of atoms       :   52 (  18 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   44 (  20   ~;  22   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f942,axiom,
    ! [X0,X1] : X0 = c_Polynomial_Opoly(c_Polynomial_OpCons(X0,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_mpoly__base__conv_I2_J_0) ).

fof(f943,plain,
    ! [X0,X1] : c_Polynomial_Opoly(c_Polynomial_OpCons(X0,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),X1,tc_Complex_Ocomplex) = X0,
    inference(reorient_equations,[],[f942]) ).

fof(f944,negated_conjecture,
    ( v_c != v_y
    | c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) != v_y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f945,plain,
    ( v_c != v_y
    | v_y != c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) ),
    inference(reorient_equations,[],[f944]) ).

fof(f946,negated_conjecture,
    ( c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) = v_y
    | v_c = v_y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f947,plain,
    ( v_y = c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex)
    | v_c = v_y ),
    inference(reorient_equations,[],[f946]) ).

fof(f1130,definition,
    ( spl0_1
  <=> v_c = v_y ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f1131,plain,
    ( v_c != v_y
    | spl0_1 ),
    inference(avatar_component_clause,[],[f1130]) ).

fof(f1132,plain,
    ( v_c = v_y
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f1130]) ).

fof(f1134,definition,
    ( spl0_2
  <=> v_y = c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f1135,plain,
    ( v_y != c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f1134]) ).

fof(f1136,plain,
    ( v_y = c_Polynomial_Opoly(c_Polynomial_OpCons(v_c,c_HOL_Ozero__class_Ozero(tc_Polynomial_Opoly(tc_Complex_Ocomplex)),tc_Complex_Ocomplex),v_x,tc_Complex_Ocomplex)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f1134]) ).

fof(f1137,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f947,f1134,f1130]) ).

fof(f1138,plain,
    ( ~ spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f945,f1130,f1134]) ).

fof(f1185,plain,
    ( v_c = v_y
    | ~ spl0_2 ),
    inference(forward_demodulation,[],[f1136,f943]) ).

fof(f1186,plain,
    ( $false
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f1185,f1131]) ).

fof(f1187,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f1186]) ).

fof(f1188,plain,
    ( v_c != v_y
    | spl0_2 ),
    inference(forward_demodulation,[],[f1135,f943]) ).

fof(f1189,plain,
    ( $false
    | ~ spl0_1
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f1188,f1132]) ).

fof(f1190,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_contradiction_clause,[],[f1189]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f1137]) ).

cnf(s2,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f1138]) ).

cnf(s10,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f1187]) ).

cnf(s11,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f1190]) ).

cnf(s12,plain,
    spl0_1,
    inference(rat,[],[s1,s10]) ).

cnf(s13,plain,
    spl0_2,
    inference(rat,[],[s11,s12]) ).

cnf(s14,plain,
    $false,
    inference(rat,[],[s2,s13,s12]) ).

fof(f1191,plain,
    $false,
    inference(avatar_sat_refutation,[],[s14]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ALG439-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17  % Computer : n001.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.17  % CPULimit : 300
% 0.11/0.17  % WCLimit  : 300
% 0.11/0.17  % DateTime : Mon Sep 28 20:30:34 UTC 2026
% 0.11/0.18  % CPUTime  : 
% 0.11/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21  Running first-order model finding
% 0.11/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.29  % (683760)Will run a generic schedule for satisfiability detection.
% 0.23/0.29  % (683769)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3916432056:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.29  % (683766)% WARNING: option uhcvi not known.
% 0.23/0.29  % (683765)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2019627858_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.29  % (683766)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1244520876:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.29  % (683767)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3628484030:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.29  % (683768)dis+10_1_sil=32000:sp=arity:random_seed=2718589325:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.29  % (683770)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3118865243:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.29  % (683771)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=266434196:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.23/0.29  % (683769) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-683760-683769"...
% 0.23/0.29  % (683769)...printing done.
% 0.23/0.29  % (683769)Refutation found. Thanks to Tanya!
% 0.23/0.29  % SZS status Unsatisfiable for theBenchmark
% 0.23/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.29  % (683769)------------------------------
% 0.23/0.29  % (683769)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.29  % (683769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.29  % (683769)CaDiCaL version: 2.1.3
% 0.23/0.29  % (683769)Termination reason: Refutation
% 0.23/0.29  % (683769)Time elapsed: 0.015 s
% 0.23/0.29  % (683769)Peak memory usage: 14 MB
% 0.23/0.29  % (683769)Instructions burned: 44 (million)
% 0.23/0.29  % (683760)Success in time 0.068 s
% 0.23/0.29  % Vampire exiting
%------------------------------------------------------------------------------