↑ 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  : LCL156-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 11:57:47 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.48s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   39 (  39 unt;   0 def)
%            Number of atoms       :   39 (  38 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    8 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   36 (  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : implies(truth,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_1) ).

fof(f4,axiom,
    ! [X0,X1] : implies(implies(X0,X1),X1) = implies(implies(X1,X0),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_3) ).

fof(f5,axiom,
    ! [X0,X1] : implies(implies(not(X0),not(X1)),implies(X1,X0)) = truth,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-0.ax',wajsberg_4) ).

fof(f6,plain,
    ! [X0,X1] : truth = implies(implies(not(X0),not(X1)),implies(X1,X0)),
    inference(reorient_equations,[],[f5]) ).

fof(f7,axiom,
    ! [X0,X1] : or(X0,X1) = implies(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_definition) ).

fof(f9,axiom,
    ! [X0,X1] : or(X0,X1) = or(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL001-2.ax',or_commutativity) ).

fof(f15,axiom,
    ! [X0,X1] : and_star(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',and_star_definition) ).

fof(f16,plain,
    ! [X0,X1] : not(or(not(X0),not(X1))) = and_star(X0,X1),
    inference(reorient_equations,[],[f15]) ).

fof(f19,axiom,
    not(truth) = falsehood,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL002-1.ax',false_definition) ).

fof(f20,negated_conjecture,
    and_star(x,truth) != x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).

fof(f21,plain,
    x != and_star(x,truth),
    inference(reorient_equations,[],[f20]) ).

fof(f24,plain,
    ! [X0,X1] : and_star(X0,X1) = not(implies(not(not(X0)),not(X1))),
    inference(definition_unfolding,[],[f16,f7]) ).

fof(f26,plain,
    ! [X0,X1] : implies(not(X0),X1) = implies(not(X1),X0),
    inference(definition_unfolding,[],[f9,f7,f7]) ).

fof(f32,plain,
    x != not(implies(not(not(x)),not(truth))),
    inference(definition_unfolding,[],[f21,f24]) ).

fof(f38,plain,
    x != not(implies(not(not(truth)),not(x))),
    inference(superposition,[],[f32,f26]) ).

fof(f40,plain,
    x != not(implies(not(falsehood),not(x))),
    inference(forward_demodulation,[],[f38,f19]) ).

fof(f46,plain,
    ! [X0] : implies(implies(X0,truth),truth) = implies(X0,X0),
    inference(superposition,[],[f4,f1]) ).

fof(f70,plain,
    ! [X0,X1] : truth = implies(implies(not(not(X0)),X1),implies(X0,X1)),
    inference(superposition,[],[f6,f26]) ).

fof(f74,plain,
    ! [X0] : truth = implies(implies(not(X0),not(truth)),X0),
    inference(superposition,[],[f6,f1]) ).

fof(f84,plain,
    ! [X0] : truth = implies(implies(not(X0),falsehood),X0),
    inference(forward_demodulation,[],[f74,f19]) ).

fof(f88,plain,
    ! [X0] : truth = implies(implies(not(falsehood),X0),X0),
    inference(superposition,[],[f84,f26]) ).

fof(f100,plain,
    truth = implies(not(falsehood),not(falsehood)),
    inference(superposition,[],[f88,f46]) ).

fof(f105,plain,
    truth = implies(truth,not(falsehood)),
    inference(superposition,[],[f88,f100]) ).

fof(f109,plain,
    truth = not(falsehood),
    inference(forward_demodulation,[],[f105,f1]) ).

fof(f111,plain,
    ! [X0] : truth = implies(implies(truth,X0),X0),
    inference(superposition,[],[f88,f109]) ).

fof(f112,plain,
    x != not(implies(truth,not(x))),
    inference(superposition,[],[f40,f109]) ).

fof(f125,plain,
    x != not(not(x)),
    inference(forward_demodulation,[],[f112,f1]) ).

fof(f126,plain,
    ! [X0] : truth = implies(X0,X0),
    inference(forward_demodulation,[],[f111,f1]) ).

fof(f130,plain,
    ! [X0] : truth = implies(implies(X0,truth),truth),
    inference(superposition,[],[f126,f46]) ).

fof(f278,plain,
    ! [X0] : truth = implies(implies(implies(not(not(X0)),truth),truth),implies(X0,not(not(X0)))),
    inference(superposition,[],[f70,f46]) ).

fof(f316,plain,
    ! [X0] : truth = implies(truth,implies(X0,not(not(X0)))),
    inference(forward_demodulation,[],[f278,f130]) ).

fof(f329,plain,
    ! [X0] : truth = implies(X0,not(not(X0))),
    inference(forward_demodulation,[],[f316,f1]) ).

fof(f343,plain,
    ! [X0] : implies(truth,not(not(X0))) = implies(implies(not(not(X0)),X0),X0),
    inference(superposition,[],[f4,f329]) ).

fof(f355,plain,
    ! [X0] : implies(truth,not(not(X0))) = implies(implies(not(X0),not(X0)),X0),
    inference(forward_demodulation,[],[f343,f26]) ).

fof(f365,plain,
    ! [X0] : implies(truth,X0) = implies(truth,not(not(X0))),
    inference(forward_demodulation,[],[f355,f126]) ).

fof(f369,plain,
    ! [X0] : implies(truth,X0) = not(not(X0)),
    inference(forward_demodulation,[],[f365,f1]) ).

fof(f371,plain,
    ! [X0] : not(not(X0)) = X0,
    inference(forward_demodulation,[],[f369,f1]) ).

fof(f375,plain,
    x != x,
    inference(superposition,[],[f125,f371]) ).

fof(f391,plain,
    $false,
    inference(trivial_inequality_removal,[],[f375]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL156-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/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.39  % DateTime : Sun Sep 27 15:26:56 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.18/0.48  % (2992212)Will run a generic schedule for satisfiability detection.
% 0.18/0.48  % (2992228)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3374012909:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.48  % (2992223)% WARNING: option uhcvi not known.
% 0.18/0.48  % (2992223)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3140788008:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.48  % (2992222)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1234999066_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.48  % (2992226)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1909039316:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.48  % (2992224)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3260431948:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.48  % (2992225)dis+10_1_sil=32000:sp=arity:random_seed=106203987:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.48  % (2992227)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=918077541:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.48  % TRYING [1]
% 0.18/0.48  % TRYING [2]
% 0.18/0.48  % TRYING [3]
% 0.18/0.48  % (2992224) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2992212-2992224"...
% 0.18/0.48  % (2992224)...printing done.
% 0.18/0.48  % (2992224)Refutation found. Thanks to Tanya!
% 0.18/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48  % (2992224)------------------------------
% 0.18/0.48  % (2992224)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.48  % (2992224)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.48  % (2992224)CaDiCaL version: 2.1.3
% 0.18/0.48  % (2992224)Termination reason: Refutation
% 0.18/0.48  % (2992224)Time elapsed: 0.009 s
% 0.18/0.48  % (2992224)Peak memory usage: 12 MB
% 0.18/0.48  % (2992224)Instructions burned: 15 (million)
% 0.18/0.48  % (2992212)Success in time 0.052 s
% 0.18/0.48  % Vampire exiting
%------------------------------------------------------------------------------