↑ 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  : SET096-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n026.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:43:06 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.50s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   35 (  14 unt;   0 def)
%            Number of atoms       :   65 (  29 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   50 (  20   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X0,X1] :
      ( ~ subclass(X0,X1)
      | ~ member(X2,X0)
      | member(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( member(not_subclass_element(X0,X1),X0)
      | subclass(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ member(not_subclass_element(X0,X1),X1)
      | subclass(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ subclass(X1,X0)
      | ~ subclass(X0,X1)
      | X0 = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ member(X0,unordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).

fof(f12,axiom,
    ! [X0] : unordered_pair(X0,X0) = singleton(X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).

fof(f67,axiom,
    ! [X0] :
      ( X0 = null_class
      | member(regular(X0),X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).

fof(f68,plain,
    ! [X0] :
      ( null_class = X0
      | member(regular(X0),X0) ),
    inference(reorient_equations,[],[f67]) ).

fof(f101,negated_conjecture,
    subclass(x,singleton(y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_1) ).

fof(f102,negated_conjecture,
    x != null_class,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_2) ).

fof(f103,plain,
    null_class != x,
    inference(reorient_equations,[],[f102]) ).

fof(f104,negated_conjecture,
    singleton(y) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_two_subsets_of_singleton_3) ).

fof(f105,plain,
    x != singleton(y),
    inference(reorient_equations,[],[f104]) ).

fof(f154,plain,
    subclass(x,unordered_pair(y,y)),
    inference(definition_unfolding,[],[f101,f12]) ).

fof(f155,plain,
    x != unordered_pair(y,y),
    inference(definition_unfolding,[],[f105,f12]) ).

fof(f159,plain,
    ! [X2,X0,X1] :
      ( ~ member(X2,X1)
      | member(X2,X0)
      | ~ subclass(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f1]) ).

fof(f160,plain,
    ! [X0,X1] :
      ( ~ member(not_subclass_element(X0,X1),X0)
      | subclass(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f2]) ).

fof(f161,plain,
    ! [X0,X1] :
      ( member(not_subclass_element(X0,X1),X1)
      | subclass(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f162,plain,
    ! [X2,X0,X1] :
      ( member(X0,unordered_pair(X1,X2))
      | X0 = X1
      | X0 = X2 ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f201,plain,
    ! [X0] :
      ( ~ member(regular(X0),X0)
      | null_class = X0 ),
    inference(consistent_polarity_flipping,[],[f68]) ).

fof(f239,plain,
    ( ~ subclass(unordered_pair(y,y),x)
    | x = unordered_pair(y,y) ),
    inference(resolution,[],[f7,f154]) ).

fof(f240,plain,
    ~ subclass(unordered_pair(y,y),x),
    inference(forward_subsumption_resolution,[],[f239,f155]) ).

fof(f267,plain,
    ! [X2,X0,X1] :
      ( subclass(unordered_pair(X0,X1),X2)
      | not_subclass_element(unordered_pair(X0,X1),X2) = X1
      | not_subclass_element(unordered_pair(X0,X1),X2) = X0 ),
    inference(resolution,[],[f162,f160]) ).

fof(f268,plain,
    ! [X2,X3,X0,X1] :
      ( ~ subclass(X3,unordered_pair(X1,X2))
      | X0 = X2
      | member(X0,X3)
      | X0 = X1 ),
    inference(resolution,[],[f162,f159]) ).

fof(f645,plain,
    ! [X0] :
      ( y = X0
      | member(X0,x)
      | y = X0 ),
    inference(resolution,[],[f268,f154]) ).

fof(f646,plain,
    ! [X0] :
      ( member(X0,x)
      | y = X0 ),
    inference(duplicate_literal_removal,[],[f645]) ).

fof(f676,plain,
    ( y = regular(x)
    | null_class = x ),
    inference(resolution,[],[f646,f201]) ).

fof(f683,plain,
    y = regular(x),
    inference(forward_subsumption_resolution,[],[f676,f103]) ).

fof(f817,plain,
    ( ~ member(y,x)
    | null_class = x ),
    inference(superposition,[],[f201,f683]) ).

fof(f818,plain,
    ~ member(y,x),
    inference(forward_subsumption_resolution,[],[f817,f103]) ).

fof(f846,plain,
    ( y = not_subclass_element(unordered_pair(y,y),x)
    | y = not_subclass_element(unordered_pair(y,y),x) ),
    inference(resolution,[],[f267,f240]) ).

fof(f852,plain,
    y = not_subclass_element(unordered_pair(y,y),x),
    inference(duplicate_literal_removal,[],[f846]) ).

fof(f1154,plain,
    ( member(y,x)
    | subclass(unordered_pair(y,y),x) ),
    inference(superposition,[],[f161,f852]) ).

fof(f1157,plain,
    subclass(unordered_pair(y,y),x),
    inference(forward_subsumption_resolution,[],[f1154,f818]) ).

fof(f1161,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1157,f240]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET096-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n026.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 00:42:57 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.16/0.50  % (3369142)Will run a generic schedule for satisfiability detection.
% 0.16/0.50  % (3369152)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=83748059:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.50  % (3369148)% WARNING: option uhcvi not known.
% 0.16/0.50  % (3369150)dis+10_1_sil=32000:sp=arity:random_seed=3704248718:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.50  % (3369147)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3580004453_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.50  % (3369148)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=896216184:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.50  % (3369151)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1188128345:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.50  % (3369149)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3056904080:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.50  % (3369153)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=667032950:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.50  % (3369152)Instruction limit reached! 
% 0.16/0.50  % (3369152)------------------------------
% 0.16/0.50  % (3369152)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.50  % (3369152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.50  % (3369152)CaDiCaL version: 2.1.3
% 0.16/0.50  % (3369152)Termination reason: Instruction limit
% 0.16/0.50  % (3369152)Termination phase: Saturation
% 0.16/0.50  % (3369152)Time elapsed: 0.043 s
% 0.16/0.50  % (3369152)Peak memory usage: 12 MB
% 0.16/0.50  % (3369152)Instructions burned: 134 (million)
% 0.16/0.50  % (3369148) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3369142-3369148"...
% 0.16/0.50  % (3369148)...printing done.
% 0.16/0.50  % (3369148)Refutation found. Thanks to Tanya!
% 0.16/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.50  % (3369148)------------------------------
% 0.16/0.50  % (3369148)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.50  % (3369148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.50  % (3369148)CaDiCaL version: 2.1.3
% 0.16/0.50  % (3369148)Termination reason: Refutation
% 0.16/0.50  % (3369148)Time elapsed: 0.039 s
% 0.16/0.50  % (3369148)Peak memory usage: 12 MB
% 0.16/0.50  % (3369148)Instructions burned: 53 (million)
% 0.16/0.50  % (3369142)Success in time 0.078 s
% 0.16/0.50  % Vampire exiting
%------------------------------------------------------------------------------