↑ 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  : LCL153-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 : n018.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.10s 0.46s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   51 (  51 unt;   0 def)
%            Number of atoms       :   51 (  50 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   13 (  13   ~;   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   :   45 (  45   !;   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(f10,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL002-1.ax',xor_definition) ).

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

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

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

fof(f22,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,f21,f21]) ).

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

fof(f31,plain,
    not(x) != implies(not(not(implies(not(not(x)),not(not(truth))))),not(implies(not(not(not(x))),not(truth)))),
    inference(definition_unfolding,[],[f20,f22]) ).

fof(f37,plain,
    not(x) != implies(not(not(implies(not(not(x)),not(not(truth))))),not(implies(not(not(truth)),not(not(x))))),
    inference(superposition,[],[f31,f25]) ).

fof(f40,plain,
    not(x) != implies(not(not(implies(not(not(truth)),not(not(x))))),not(implies(not(not(x)),not(not(truth))))),
    inference(forward_demodulation,[],[f37,f25]) ).

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

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

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

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

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

fof(f91,plain,
    ! [X0] : truth = implies(implies(not(falsehood),X0),X0),
    inference(superposition,[],[f87,f25]) ).

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

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

fof(f112,plain,
    truth = not(falsehood),
    inference(forward_demodulation,[],[f108,f1]) ).

fof(f114,plain,
    ! [X0] : truth = implies(implies(truth,X0),X0),
    inference(superposition,[],[f91,f112]) ).

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

fof(f122,plain,
    ! [X0] : implies(truth,X0) = implies(not(X0),falsehood),
    inference(superposition,[],[f25,f112]) ).

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

fof(f130,plain,
    not(x) != implies(not(not(implies(truth,not(not(x))))),not(implies(not(truth),not(x)))),
    inference(forward_demodulation,[],[f115,f25]) ).

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

fof(f133,plain,
    not(x) != implies(not(not(implies(truth,not(not(x))))),not(implies(falsehood,not(x)))),
    inference(forward_demodulation,[],[f130,f19]) ).

fof(f135,plain,
    not(x) != implies(not(not(implies(falsehood,not(x)))),not(implies(truth,not(not(x))))),
    inference(forward_demodulation,[],[f133,f25]) ).

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

fof(f139,plain,
    not(x) != implies(not(not(not(not(x)))),not(implies(falsehood,not(x)))),
    inference(forward_demodulation,[],[f137,f25]) ).

fof(f146,plain,
    ! [X0] : truth = implies(implies(X0,truth),truth),
    inference(superposition,[],[f131,f49]) ).

fof(f298,plain,
    ! [X0] : truth = implies(implies(implies(not(not(X0)),truth),truth),implies(X0,not(not(X0)))),
    inference(superposition,[],[f73,f49]) ).

fof(f336,plain,
    ! [X0] : truth = implies(truth,implies(X0,not(not(X0)))),
    inference(forward_demodulation,[],[f298,f146]) ).

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

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

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

fof(f385,plain,
    ! [X0] : implies(truth,X0) = implies(truth,not(not(X0))),
    inference(forward_demodulation,[],[f375,f131]) ).

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

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

fof(f411,plain,
    ! [X0,X1] : implies(X0,X1) = implies(not(X1),not(X0)),
    inference(superposition,[],[f25,f391]) ).

fof(f417,plain,
    ! [X0] : not(X0) = implies(X0,falsehood),
    inference(superposition,[],[f123,f391]) ).

fof(f494,plain,
    ! [X0] : implies(not(X0),falsehood) = implies(implies(falsehood,X0),X0),
    inference(superposition,[],[f4,f417]) ).

fof(f522,plain,
    ! [X0] : implies(implies(falsehood,X0),X0) = X0,
    inference(forward_demodulation,[],[f494,f123]) ).

fof(f618,plain,
    not(x) != implies(implies(falsehood,not(x)),not(not(not(x)))),
    inference(superposition,[],[f139,f411]) ).

fof(f647,plain,
    not(x) != implies(implies(falsehood,not(x)),not(x)),
    inference(forward_demodulation,[],[f618,f391]) ).

fof(f661,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f647,f522]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL153-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 15:26:08 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.10/0.46  % (2506479)Will run a generic schedule for satisfiability detection.
% 0.10/0.46  % (2506484)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=884117270_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46  % TRYING [1]
% 0.10/0.46  % TRYING [2]
% 0.10/0.46  % TRYING [3]
% 0.10/0.46  % (2506490)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=210555544:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46  % (2506486)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2602712529:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46  % (2506487)dis+10_1_sil=32000:sp=arity:random_seed=403953517:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46  % (2506488)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=703735677:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46  % (2506489)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3608331474:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46  % (2506485)% WARNING: option uhcvi not known.
% 0.10/0.46  % TRYING [4]
% 0.10/0.46  % (2506485)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2306015431:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46  % (2506486) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2506479-2506486"...
% 0.10/0.46  % (2506486)...printing done.
% 0.10/0.46  % (2506486)Refutation found. Thanks to Tanya!
% 0.10/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.46  % (2506486)------------------------------
% 0.10/0.46  % (2506486)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.46  % (2506486)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.46  % (2506486)CaDiCaL version: 2.1.3
% 0.10/0.46  % (2506486)Termination reason: Refutation
% 0.10/0.46  % (2506486)Time elapsed: 0.015 s
% 0.10/0.46  % (2506486)Peak memory usage: 11 MB
% 0.10/0.46  % (2506486)Instructions burned: 23 (million)
% 0.10/0.46  % (2506479)Success in time 0.049 s
% 0.10/0.46  % Vampire exiting
%------------------------------------------------------------------------------