↑ 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  : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n020.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.26s 0.59s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   48 (  48 unt;   0 def)
%            Number of atoms       :   48 (  47 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   14 (  14   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : implies(truth,X0) = X0,
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL001-2.ax',or_definition) ).

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

fof(f10,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL001-2.ax',and_definition) ).

fof(f13,axiom,
    ! [X0,X1] : xor(X0,X1) = or(and(X0,not(X1)),and(not(X0),X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL002-1.ax',xor_definition) ).

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

fof(f20,negated_conjecture,
    xor(x,falsehood) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_alternative_wajsberg_axiom) ).

fof(f21,plain,
    x != xor(x,falsehood),
    inference(reorient_equations,[],[f20]) ).

fof(f22,plain,
    ! [X0,X1] : and(X0,X1) = not(implies(not(not(X0)),not(X1))),
    inference(definition_unfolding,[],[f10,f7]) ).

fof(f23,plain,
    ! [X0,X1] : xor(X0,X1) = implies(not(not(implies(not(not(X0)),not(not(X1))))),not(implies(not(not(not(X0))),not(X1)))),
    inference(definition_unfolding,[],[f13,f7,f22,f22]) ).

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

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

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

fof(f37,plain,
    x != implies(not(not(implies(not(not(falsehood)),not(not(x))))),not(implies(not(not(x)),not(not(falsehood))))),
    inference(forward_demodulation,[],[f36,f26]) ).

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

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

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

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

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

fof(f97,plain,
    truth = implies(not(falsehood),not(falsehood)),
    inference(superposition,[],[f85,f43]) ).

fof(f103,plain,
    truth = implies(truth,not(falsehood)),
    inference(superposition,[],[f85,f97]) ).

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

fof(f108,plain,
    ! [X0] : truth = implies(implies(truth,X0),X0),
    inference(superposition,[],[f85,f105]) ).

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

fof(f117,plain,
    ! [X0] : implies(not(X0),falsehood) = X0,
    inference(forward_demodulation,[],[f116,f1]) ).

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

fof(f139,plain,
    ! [X0] : truth = implies(implies(X0,truth),truth),
    inference(superposition,[],[f125,f43]) ).

fof(f286,plain,
    ! [X0] : truth = implies(implies(implies(not(not(X0)),truth),truth),implies(X0,not(not(X0)))),
    inference(superposition,[],[f67,f43]) ).

fof(f324,plain,
    ! [X0] : truth = implies(truth,implies(X0,not(not(X0)))),
    inference(forward_demodulation,[],[f286,f139]) ).

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

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

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

fof(f373,plain,
    ! [X0] : implies(truth,X0) = implies(truth,not(not(X0))),
    inference(forward_demodulation,[],[f363,f125]) ).

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

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

fof(f386,plain,
    x != implies(implies(not(not(falsehood)),not(not(x))),not(implies(not(not(x)),not(not(falsehood))))),
    inference(superposition,[],[f37,f379]) ).

fof(f413,plain,
    x != implies(implies(falsehood,not(not(x))),not(implies(not(not(x)),falsehood))),
    inference(forward_demodulation,[],[f386,f379]) ).

fof(f420,plain,
    x != implies(implies(falsehood,not(not(x))),not(implies(not(falsehood),not(x)))),
    inference(forward_demodulation,[],[f413,f26]) ).

fof(f427,plain,
    x != implies(implies(falsehood,not(not(x))),not(implies(truth,not(x)))),
    inference(forward_demodulation,[],[f420,f105]) ).

fof(f434,plain,
    x != implies(implies(falsehood,not(not(x))),not(not(x))),
    inference(forward_demodulation,[],[f427,f1]) ).

fof(f441,plain,
    x != implies(implies(not(not(x)),falsehood),falsehood),
    inference(forward_demodulation,[],[f434,f4]) ).

fof(f447,plain,
    x != implies(implies(not(falsehood),not(x)),falsehood),
    inference(forward_demodulation,[],[f441,f26]) ).

fof(f453,plain,
    x != implies(implies(truth,not(x)),falsehood),
    inference(forward_demodulation,[],[f447,f105]) ).

fof(f457,plain,
    x != implies(not(x),falsehood),
    inference(forward_demodulation,[],[f453,f1]) ).

fof(f459,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f457,f117]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL154-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.43  % Computer : n020.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Sun Sep 27 15:24:49 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.17/0.49  Running first-order model finding
% 0.17/0.49  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.26/0.59  % (3530223)Will run a generic schedule for satisfiability detection.
% 0.26/0.59  % (3530228)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1607408004_2999 on theBenchmark for (2999ds/0Mi)
% 0.26/0.59  % TRYING [1]
% 0.26/0.59  % TRYING [2]
% 0.26/0.59  % TRYING [3]
% 0.26/0.59  % (3530229)% WARNING: option uhcvi not known.
% 0.26/0.59  % (3530234)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3369477807:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.26/0.59  % (3530230)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3621579119:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.26/0.59  % (3530231)dis+10_1_sil=32000:sp=arity:random_seed=3242369582:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.26/0.59  % (3530232)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3467743236:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.26/0.59  % (3530233)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=350135085:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.26/0.59  % TRYING [4]
% 0.26/0.59  % (3530229)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1760813761:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.26/0.59  % (3530230) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3530223-3530230"...
% 0.26/0.59  % (3530230)...printing done.
% 0.26/0.59  % (3530230)Refutation found. Thanks to Tanya!
% 0.26/0.59  % SZS status Unsatisfiable for theBenchmark
% 0.26/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.59  % (3530230)------------------------------
% 0.26/0.59  % (3530230)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.59  % (3530230)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.59  % (3530230)CaDiCaL version: 2.1.3
% 0.26/0.59  % (3530230)Termination reason: Refutation
% 0.26/0.59  % (3530230)Time elapsed: 0.019 s
% 0.26/0.59  % (3530230)Peak memory usage: 11 MB
% 0.26/0.59  % (3530230)Instructions burned: 17 (million)
% 0.26/0.59  % (3530223)Success in time 0.078 s
% 0.26/0.59  % Vampire exiting
%------------------------------------------------------------------------------