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

% Computer : n019.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 11:58:37 AM UTC 2026

% Result   : Unsatisfiable 0.08s 0.47s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   17 (  10 unt;   0 def)
%            Number of atoms       :   27 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  11   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   7 con; 0-3 aty)
%            Number of variables   :   44 (  44   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ c_in(X0,c_PropLog_Othms(c_minus(X1,X2,tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3))
      | ~ c_lessequals(X1,X4,tc_set(tc_PropLog_Opl(X3)))
      | c_in(X0,c_PropLog_Othms(c_minus(X4,X2,tc_set(tc_PropLog_Opl(X3))),X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_ODiff__weaken__left_0) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1] : c_lessequals(c_PropLog_Ohyps(X0,c_minus(X1,c_insert(X2,c_emptyset,X3),tc_set(X3)),X3),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,X3),c_PropLog_Opl_Ofalse,X3),c_minus(c_PropLog_Ohyps(X0,X1,X3),c_insert(c_PropLog_Opl_Ovar(X2,X3),c_emptyset,tc_PropLog_Opl(X3)),tc_set(tc_PropLog_Opl(X3))),tc_PropLog_Opl(X3)),tc_set(tc_PropLog_Opl(X3))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Ohyps__Diff_0) ).

fof(f3,axiom,
    ! [X2,X3,X0,X1] : c_lessequals(c_minus(X0,X1,tc_set(X2)),c_insert(X3,c_minus(X0,c_insert(X3,X1,X2),tc_set(X2)),X2),tc_set(X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oinsert__Diff__same_0) ).

fof(f4,axiom,
    ! [X2,X3,X0,X1,X4] : c_lessequals(c_minus(c_insert(X0,c_minus(X1,c_insert(X2,c_emptyset,X3),tc_set(X3)),X3),X4,tc_set(X3)),c_insert(X0,c_minus(X1,c_insert(X2,X4,X3),tc_set(X3)),X3),tc_set(X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oinsert__Diff__subset2_0) ).

fof(f5,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_in(X0,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X1,c_PropLog_Opl_Ofalse,X3),X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
      | ~ c_in(X0,c_PropLog_Othms(c_insert(X1,X2,tc_PropLog_Opl(X3)),X3),tc_PropLog_Opl(X3))
      | c_in(X0,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms__excluded__middle__rule_0) ).

fof(f6,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ c_in(X0,c_PropLog_Othms(X1,X2),tc_PropLog_Opl(X2))
      | ~ c_lessequals(X1,X3,tc_set(tc_PropLog_Opl(X2)))
      | c_in(X0,c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__left_0) ).

fof(f7,negated_conjecture,
    ! [X0] : c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X0,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f8,negated_conjecture,
    ~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Ovar(v_v,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

fof(f9,plain,
    ! [X0,X1] :
      ( ~ c_lessequals(c_minus(c_PropLog_Ohyps(v_p,X0,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a)))
      | c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a)) ),
    inference(resolution,[],[f6,f7]) ).

fof(f10,plain,
    ! [X0,X1] : c_in(v_p,c_PropLog_Othms(c_insert(X0,c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(X0,v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    inference(resolution,[],[f9,f3]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ c_lessequals(c_PropLog_Ohyps(v_p,X0,t_a),X1,tc_set(tc_PropLog_Opl(t_a)))
      | c_in(v_p,c_PropLog_Othms(c_minus(X1,v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ),
    inference(resolution,[],[f1,f7]) ).

fof(f14,plain,
    ! [X0,X1] : c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X0,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X0,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
    inference(resolution,[],[f2,f12]) ).

fof(f15,plain,
    ! [X2,X0,X1] :
      ( ~ c_lessequals(c_minus(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X0,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X0,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),X2,tc_set(tc_PropLog_Opl(t_a)))
      | c_in(v_p,c_PropLog_Othms(X2,t_a),tc_PropLog_Opl(t_a)) ),
    inference(resolution,[],[f14,f6]) ).

fof(f17,plain,
    ! [X0,X1] : c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X0,t_a),c_PropLog_Opl_Ofalse,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X0,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
    inference(resolution,[],[f15,f4]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(X0,t_a),c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X0,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a))
      | c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X0,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)) ),
    inference(resolution,[],[f17,f5]) ).

fof(f21,plain,
    ! [X0,X1] : c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Ovar(X0,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
    inference(forward_subsumption_resolution,[],[f19,f10]) ).

fof(f22,plain,
    $false,
    inference(resolution,[],[f21,f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL429-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.37  % Computer : n019.cluster.edu
% 0.08/0.37  % Model    : x86_64 x86_64
% 0.08/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37  % Memory   : 8046.5625MB
% 0.08/0.37  % OS       : Linux 6.8.0-71-generic
% 0.08/0.37  % CPULimit : 300
% 0.08/0.37  % WCLimit  : 300
% 0.08/0.37  % DateTime : Sun Sep 27 15:42:03 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.42  Running first-order model finding
% 0.08/0.42  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.08/0.47  % (3226641)Will run a generic schedule for satisfiability detection.
% 0.08/0.47  % (3226649)dis+10_1_sil=32000:sp=arity:random_seed=91399692:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.47  % (3226649) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3226641-3226649"...
% 0.08/0.47  % (3226649)...printing done.
% 0.08/0.47  % (3226647)% WARNING: option uhcvi not known.
% 0.08/0.47  % (3226649)Refutation found. Thanks to Tanya!
% 0.08/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.48  % (3226649)------------------------------
% 0.08/0.48  % (3226649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.48  % (3226649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.48  % (3226649)CaDiCaL version: 2.1.3
% 0.08/0.48  % (3226649)Termination reason: Refutation
% 0.08/0.48  % (3226649)Time elapsed: 0.002 s
% 0.08/0.48  % (3226649)Peak memory usage: 11 MB
% 0.08/0.48  % (3226649)Instructions burned: 2 (million)
% 0.08/0.48  % (3226641)Success in time 0.041 s
% 0.08/0.48  % Vampire exiting
%------------------------------------------------------------------------------