↑ Up

Vampire-SAT---5.0.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : LCL641+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n005.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:59:07 AM UTC 2026

% Result   : CounterSatisfiable 0.17s 0.48s
% Output   : Saturation 0.17s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u70,negated_conjecture,
    p1(sK18) ).

cnf(u82,negated_conjecture,
    ~ r1(sK17,sK15(sK17)) ).

cnf(u87,negated_conjecture,
    sP0(sK17) ).

cnf(u117,negated_conjecture,
    ~ r1(sK18,sK14(sK18)) ).

cnf(u121,negated_conjecture,
    ( ~ r1(sK18,X0)
    | p1(X1)
    | ~ r1(X0,X1) ) ).

cnf(u147,negated_conjecture,
    ~ r1(sK17,sK13) ).

cnf(u160,negated_conjecture,
    ~ r1(sK17,sK16) ).

cnf(u172,negated_conjecture,
    ~ p1(sK7(sK17)) ).

cnf(u175,negated_conjecture,
    ( ~ p1(sK6(X1))
    | ~ r1(sK17,X1) ) ).

cnf(u178,negated_conjecture,
    ( ~ r1(sK17,X0)
    | p1(X0) ) ).

cnf(u42,axiom,
    ( ~ sP0(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | p1(sK11(X2))
    | ~ r1(X0,X1) ) ).

cnf(u52,negated_conjecture,
    ~ p1(sK17) ).

cnf(u34,axiom,
    ( ~ sP2(X0)
    | p1(X1)
    | p1(X0)
    | ~ r1(X0,X2)
    | r1(X2,sK6(X2))
    | r1(X0,sK7(X0))
    | ~ r1(X0,X1) ) ).

cnf(u39,axiom,
    ( ~ sP1(X0)
    | ~ p1(sK9(X0)) ) ).

cnf(u44,axiom,
    ( ~ sP0(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | r1(sK11(X2),sK12(X2))
    | ~ r1(X0,X1) ) ).

cnf(u46,negated_conjecture,
    ( ~ r1(sK17,X14)
    | p1(X14)
    | p1(sK19(X14)) ) ).

cnf(u72,negated_conjecture,
    ( ~ r1(sK16,X0)
    | sP2(X0) ) ).

cnf(u113,negated_conjecture,
    ( ~ r1(sK17,X0)
    | ~ r1(X0,X1)
    | ~ r1(X1,X2)
    | p1(X2)
    | r1(X0,sK14(X0)) ) ).

cnf(u74,negated_conjecture,
    sP2(sK17) ).

cnf(u26,axiom,
    ( ~ sP3(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | ~ p1(X1)
    | ~ r1(X0,X3)
    | p1(X3)
    | ~ p1(X0)
    | ~ r1(X0,X4)
    | ~ p1(sK5(X4))
    | sP1(X0)
    | ~ r1(X0,X1) ) ).

cnf(u78,negated_conjecture,
    ( ~ r1(sK16,X0)
    | sP0(X0)
    | r1(X0,sK15(X0)) ) ).

cnf(u45,axiom,
    ( ~ sP0(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | r1(X2,sK11(X2))
    | ~ r1(X0,X1) ) ).

cnf(u137,negated_conjecture,
    ( ~ r1(X0,X1)
    | p1(X1)
    | p1(sK11(X1))
    | ~ r1(sK17,X0) ) ).

cnf(u30,axiom,
    ( ~ sP2(X0)
    | p1(X1)
    | p1(X0)
    | ~ r1(X0,X2)
    | ~ p1(sK6(X2))
    | ~ p1(sK7(X0))
    | ~ r1(X0,X1) ) ).

cnf(u27,axiom,
    ( ~ sP3(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | ~ p1(X1)
    | ~ r1(X0,X3)
    | p1(X3)
    | ~ p1(X0)
    | ~ r1(X0,X4)
    | r1(sK4(X4),sK5(X4))
    | sP1(X0)
    | ~ r1(X0,X1) ) ).

cnf(u57,negated_conjecture,
    ( ~ r1(sK13,X1)
    | ~ r1(X1,X2)
    | sP0(X2)
    | r1(X2,sK15(X2)) ) ).

cnf(u40,axiom,
    ( ~ sP1(X0)
    | r1(sK8(X0),sK9(X0)) ) ).

cnf(u58,negated_conjecture,
    ( ~ p1(sK14(X3))
    | ~ r1(X1,X2)
    | ~ r1(X2,X3)
    | ~ r1(X3,X4)
    | ~ r1(X4,X5)
    | p1(X5)
    | ~ r1(sK13,X1) ) ).

cnf(u59,negated_conjecture,
    ( ~ r1(sK13,X1)
    | ~ r1(X1,X2)
    | ~ r1(X2,X3)
    | ~ r1(X3,X4)
    | ~ r1(X4,X5)
    | p1(X5)
    | r1(X3,sK14(X3)) ) ).

cnf(u51,negated_conjecture,
    r1(sK17,sK18) ).

cnf(u61,negated_conjecture,
    ( ~ r1(sK13,X1)
    | ~ r1(X1,X2)
    | sP3(X2) ) ).

cnf(u139,negated_conjecture,
    ( ~ r1(X0,X1)
    | p1(X1)
    | r1(X1,sK11(X1))
    | ~ r1(sK17,X0) ) ).

cnf(u53,negated_conjecture,
    r1(sK16,sK17) ).

cnf(u55,negated_conjecture,
    ( ~ p1(X8)
    | ~ r1(X1,X2)
    | sP0(X2)
    | ~ r1(sK15(X2),X8)
    | ~ r1(X8,X9)
    | p1(X9)
    | ~ r1(sK13,X1) ) ).

cnf(u49,negated_conjecture,
    ( ~ r1(sK17,X14)
    | p1(X14)
    | r1(X14,sK19(X14)) ) ).

cnf(u47,negated_conjecture,
    ( ~ p1(sK20(X14))
    | p1(X14)
    | ~ r1(sK17,X14) ) ).

cnf(u41,axiom,
    ( ~ sP1(X0)
    | r1(X0,sK8(X0)) ) ).

cnf(u43,axiom,
    ( ~ sP0(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | ~ p1(sK12(X2))
    | ~ r1(X0,X1) ) ).

cnf(u35,axiom,
    ( ~ sP1(X0)
    | ~ r1(X3,X4)
    | ~ r1(X4,X5)
    | p1(X5)
    | ~ p1(X4)
    | p1(X3)
    | ~ r1(sK8(X0),X3) ) ).

cnf(u166,negated_conjecture,
    ( ~ r1(X0,X1)
    | p1(X1)
    | r1(sK11(X1),sK12(X1))
    | ~ r1(sK17,X0) ) ).

cnf(u37,axiom,
    ( ~ sP1(X0)
    | ~ r1(X3,X4)
    | ~ r1(X4,X5)
    | p1(X5)
    | ~ p1(X4)
    | r1(X3,sK10(X3))
    | ~ r1(sK8(X0),X3) ) ).

cnf(u73,negated_conjecture,
    ( ~ r1(sK16,X0)
    | sP3(X0) ) ).

cnf(u33,axiom,
    ( ~ sP2(X0)
    | p1(X1)
    | p1(X0)
    | ~ r1(X0,X2)
    | r1(X2,sK6(X2))
    | ~ p1(sK7(X0))
    | ~ r1(X0,X1) ) ).

cnf(u31,axiom,
    ( ~ sP2(X0)
    | p1(X1)
    | p1(X0)
    | ~ r1(X0,X2)
    | ~ p1(sK6(X2))
    | r1(X0,sK7(X0))
    | ~ r1(X0,X1) ) ).

cnf(u112,negated_conjecture,
    ( ~ r1(sK16,X0)
    | ~ r1(X0,X1)
    | ~ r1(X1,X2)
    | ~ r1(X2,X3)
    | p1(X3)
    | r1(X1,sK14(X1)) ) ).

cnf(u25,axiom,
    ( ~ sP3(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | ~ p1(X1)
    | ~ r1(X0,X3)
    | p1(X3)
    | ~ p1(X0)
    | ~ r1(X0,X4)
    | p1(sK4(X4))
    | sP1(X0)
    | ~ r1(X0,X1) ) ).

cnf(u77,negated_conjecture,
    sP3(sK17) ).

cnf(u56,negated_conjecture,
    ( ~ p1(sK15(X2))
    | ~ r1(X1,X2)
    | sP0(X2)
    | ~ r1(sK13,X1) ) ).

cnf(u29,axiom,
    ( ~ sP2(X0)
    | p1(X1)
    | p1(X0)
    | ~ r1(X0,X2)
    | ~ p1(sK6(X2))
    | ~ r1(sK7(X0),X5)
    | ~ r1(X5,X6)
    | p1(X6)
    | ~ p1(X5)
    | ~ r1(X0,X1) ) ).

cnf(u28,axiom,
    ( ~ sP3(X0)
    | ~ r1(X1,X2)
    | p1(X2)
    | ~ p1(X1)
    | ~ r1(X0,X3)
    | p1(X3)
    | ~ p1(X0)
    | ~ r1(X0,X4)
    | r1(X4,sK4(X4))
    | sP1(X0)
    | ~ r1(X0,X1) ) ).

cnf(u38,axiom,
    ( ~ sP1(X0)
    | p1(sK8(X0)) ) ).

cnf(u50,negated_conjecture,
    ( ~ r1(sK18,X13)
    | p1(X13) ) ).

cnf(u60,negated_conjecture,
    ( ~ r1(sK13,X1)
    | ~ r1(X1,X2)
    | sP2(X2) ) ).

cnf(u32,axiom,
    ( ~ sP2(X0)
    | p1(X1)
    | p1(X0)
    | ~ r1(X0,X2)
    | r1(X2,sK6(X2))
    | ~ r1(sK7(X0),X5)
    | ~ r1(X5,X6)
    | p1(X6)
    | ~ p1(X5)
    | ~ r1(X0,X1) ) ).

cnf(u138,negated_conjecture,
    ( ~ p1(sK12(X1))
    | p1(X1)
    | ~ r1(X0,X1)
    | ~ r1(sK17,X0) ) ).

cnf(u54,negated_conjecture,
    r1(sK13,sK16) ).

cnf(u36,axiom,
    ( ~ sP1(X0)
    | ~ r1(X3,X4)
    | ~ r1(X4,X5)
    | p1(X5)
    | ~ p1(X4)
    | ~ p1(sK10(X3))
    | ~ r1(sK8(X0),X3) ) ).

cnf(u48,negated_conjecture,
    ( ~ r1(sK17,X14)
    | p1(X14)
    | r1(sK19(X14),sK20(X14)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL641+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  % Computer : n005.cluster.edu
% 0.11/0.40  % Model    : x86_64 x86_64
% 0.11/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40  % Memory   : 8046.5625MB
% 0.11/0.40  % OS       : Linux 6.8.0-71-generic
% 0.11/0.40  % CPULimit : 300
% 0.11/0.40  % WCLimit  : 300
% 0.11/0.40  % DateTime : Sun Sep 27 16:09:17 UTC 2026
% 0.11/0.40  % CPUTime  : 
% 0.11/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43  Running first-order model finding
% 0.11/0.43  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  % (4177519)Will run a generic schedule for satisfiability detection.
% 0.17/0.48  % (4177528)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3482999761:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.48  % (4177525)% WARNING: option uhcvi not known.
% 0.17/0.48  % (4177524)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3171506771_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.48  % (4177525)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=811871513:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.48  % (4177526)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1255450672:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.48  % (4177527)dis+10_1_sil=32000:sp=arity:random_seed=1838539869:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.48  % (4177529)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1740291315:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.48  % (4177530)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1117366331:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.48  % (4177529) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4177519-4177529"...
% 0.17/0.48  % TRYING [1]
% 0.17/0.48  % TRYING [2]
% 0.17/0.48  % (4177529)...printing done.
% 0.17/0.48  % SZS status CounterSatisfiable for theBenchmark
% 0.17/0.48  % SZS output start Saturation.
% See solution above
% 0.17/0.48  % SZS output start Definitions and Model Updates.
% 0.17/0.48  % SZS output end Definitions and Model Updates.
% 0.17/0.48  % (4177529)------------------------------
% 0.17/0.48  % (4177529)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.48  % (4177529)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.48  % (4177529)CaDiCaL version: 2.1.3
% 0.17/0.48  % (4177529)Termination reason: Satisfiable
% 0.17/0.48  % (4177529)Time elapsed: 0.004 s
% 0.17/0.48  % (4177529)Peak memory usage: 11 MB
% 0.17/0.48  % (4177529)Instructions burned: 5 (million)
% 0.17/0.48  % (4177519)Success in time 0.038 s
% 0.17/0.48  % Vampire exiting
%------------------------------------------------------------------------------