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

% Computer : n006.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:08 AM UTC 2026

% Result   : Unsatisfiable 0.17s 0.48s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  16 unt;   0 def)
%            Number of atoms       :   33 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  12   ~;  10   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   49 (  49   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).

fof(f10,negated_conjecture,
    ~ theorem(implies(q,implies(p,and(p,q)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f13,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f14,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f17,plain,
    ~ theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))),
    inference(definition_unfolding,[],[f10,f6,f6,f9]) ).

fof(f20,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f13,f7]) ).

fof(f23,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f14,f7]) ).

fof(f27,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f15,f7]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f23,f16]) ).

fof(f36,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X0,X1)),or(X0,X2)))
      | ~ theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f27,f16]) ).

fof(f50,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(X1,X0)),X1))),
    inference(resolution,[],[f30,f20]) ).

fof(f57,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | theorem(or(X2,X1))
      | ~ theorem(or(X2,X0)) ),
    inference(resolution,[],[f36,f16]) ).

fof(f121,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X2,X1)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f57,f20]) ).

fof(f353,plain,
    ! [X0,X1] : theorem(or(X0,or(X1,not(or(X1,X0))))),
    inference(resolution,[],[f121,f50]) ).

fof(f738,plain,
    $false,
    inference(resolution,[],[f353,f17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL237-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39  % Computer : n006.cluster.edu
% 0.12/0.39  % Model    : x86_64 x86_64
% 0.12/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39  % Memory   : 8046.5625MB
% 0.12/0.39  % OS       : Linux 6.8.0-71-generic
% 0.12/0.39  % CPULimit : 300
% 0.12/0.39  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 15:28:25 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/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.17/0.48  % (3101892)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (3101904)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3465386282_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % TRYING [1]
% 0.17/0.48  % TRYING [2]
% 0.17/0.48  % TRYING [3]
% 0.17/0.48  % (3101905)% WARNING: option uhcvi not known.
% 0.17/0.48  % (3101905)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4229492652:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (3101906)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=21988428:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (3101907)dis+10_1_sil=32000:sp=arity:random_seed=2966287182:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (3101908)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2051807659:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (3101909)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3940697973:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % (3101910)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1733219669:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % TRYING [4]
% 0.17/0.48  % (3101907) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3101892-3101907"...
% 0.17/0.48  % (3101907)...printing done.
% 0.17/0.48  % (3101907)Refutation found. Thanks to Tanya!
% 0.17/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.48  % (3101907)------------------------------
% 0.17/0.48  % (3101907)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (3101907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (3101907)CaDiCaL version: 2.1.3
% 0.17/0.48  % (3101907)Termination reason: Refutation
% 0.17/0.48  % (3101907)Time elapsed: 0.015 s
% 0.17/0.48  % (3101907)Peak memory usage: 11 MB
% 0.17/0.48  % (3101907)Instructions burned: 22 (million)
% 0.17/0.48  % (3101892)Success in time 0.048 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------