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

% Computer : n007.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:11 AM UTC 2026

% Result   : Unsatisfiable 2.17s 0.93s
% Output   : Refutation 2.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   40 (  28 unt;   0 def)
%            Number of atoms       :   55 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   34 (  19   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   75 (  75   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(implies(or(X0,X0),X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

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

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

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

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

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

fof(f11,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

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

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(or(not(p),r)),or(not(not(or(not(p),not(q)))),r))),
    inference(definition_unfolding,[],[f10,f6,f6,f6,f9]) ).

fof(f18,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f11,f7]) ).

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

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

fof(f21,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f16,f18]) ).

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

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

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

fof(f85,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f81,f19]) ).

fof(f91,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f85,f21]) ).

fof(f129,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f27,f91]) ).

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

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

fof(f392,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,X1)),or(not(or(not(X1),X2)),or(X0,X2)))),
    inference(resolution,[],[f357,f81]) ).

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

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

fof(f1684,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f683,f129]) ).

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

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

fof(f3460,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f1629,f19]) ).

fof(f3560,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X0),X1))),
    inference(resolution,[],[f3460,f81]) ).

fof(f4680,plain,
    ~ theorem(or(not(not(or(not(p),not(q)))),p)),
    inference(resolution,[],[f2081,f17]) ).

fof(f4692,plain,
    ~ theorem(or(p,or(not(p),not(q)))),
    inference(resolution,[],[f4680,f1781]) ).

fof(f4696,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f4692,f3560]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL249-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.47  % Computer : n007.cluster.edu
% 0.22/0.47  % Model    : x86_64 x86_64
% 0.22/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47  % Memory   : 8046.5625MB
% 0.22/0.47  % OS       : Linux 6.8.0-71-generic
% 0.22/0.47  % CPULimit : 300
% 0.22/0.47  % WCLimit  : 300
% 0.22/0.47  % DateTime : Sun Sep 27 15:28:40 UTC 2026
% 0.22/0.47  % CPUTime  : 
% 0.22/0.47  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.52  Running first-order model finding
% 0.25/0.52  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
% 2.17/0.92  % (1590062)Will run a generic schedule for satisfiability detection.
% 2.17/0.92  % (1590067)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2922125814_2999 on theBenchmark for (2999ds/0Mi)
% 2.17/0.92  % TRYING [1]
% 2.17/0.92  % TRYING [2]
% 2.17/0.92  % TRYING [3]
% 2.17/0.92  % (1590068)% WARNING: option uhcvi not known.
% 2.17/0.92  % (1590071)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2145113286:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.17/0.92  % (1590069)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3689038962:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.17/0.92  % (1590068)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2056191379:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.17/0.92  % (1590070)dis+10_1_sil=32000:sp=arity:random_seed=1757337276:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.17/0.92  % (1590073)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1113752052:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.17/0.92  % TRYING [4]
% 2.17/0.92  % (1590072)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1312599237:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.17/0.92  % (1590071)Instruction limit reached! 
% 2.17/0.92  % (1590071)------------------------------
% 2.17/0.92  % (1590071)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.92  % (1590071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.92  % (1590071)CaDiCaL version: 2.1.3
% 2.17/0.92  % (1590071)Termination reason: Instruction limit
% 2.17/0.92  % (1590071)Termination phase: Saturation
% 2.17/0.92  % (1590071)Time elapsed: 0.090 s
% 2.17/0.92  % (1590071)Peak memory usage: 11 MB
% 2.17/0.92  % (1590071)Instructions burned: 116 (million)
% 2.17/0.92  % (1590070)Instruction limit reached! 
% 2.17/0.92  % (1590070)------------------------------
% 2.17/0.92  % (1590070)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.92  % (1590070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.92  % (1590070)CaDiCaL version: 2.1.3
% 2.17/0.92  % (1590070)Termination reason: Instruction limit
% 2.17/0.92  % (1590070)Termination phase: Saturation
% 2.17/0.92  % (1590070)Time elapsed: 0.106 s
% 2.17/0.92  % (1590070)Peak memory usage: 11 MB
% 2.17/0.92  % (1590070)Instructions burned: 104 (million)
% 2.17/0.92  % (1590081)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2567316535:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.17/0.92  % TRYING [1]
% 2.17/0.92  % TRYING [2]
% 2.17/0.92  % TRYING [3]
% 2.17/0.92  % (1590082)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1286094867:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.17/0.92  % (1590073)Instruction limit reached! 
% 2.17/0.92  % (1590073)------------------------------
% 2.17/0.92  % (1590073)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.92  % (1590073)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.92  % (1590073)CaDiCaL version: 2.1.3
% 2.17/0.92  % (1590073)Termination reason: Instruction limit
% 2.17/0.92  % (1590073)Termination phase: Saturation
% 2.17/0.92  % (1590073)Time elapsed: 0.167 s
% 2.17/0.92  % (1590073)Peak memory usage: 13 MB
% 2.17/0.92  % (1590073)Instructions burned: 159 (million)
% 2.17/0.92  % TRYING [4]
% 2.17/0.92  % (1590072)Instruction limit reached! 
% 2.17/0.93  % (1590072)------------------------------
% 2.17/0.93  % (1590072)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.93  % (1590072)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.93  % (1590072)CaDiCaL version: 2.1.3
% 2.17/0.93  % (1590072)Termination reason: Instruction limit
% 2.17/0.93  % (1590072)Termination phase: Saturation
% 2.17/0.93  % (1590072)Time elapsed: 0.160 s
% 2.17/0.93  % (1590072)Peak memory usage: 13 MB
% 2.17/0.93  % (1590072)Instructions burned: 131 (million)
% 2.17/0.93  % (1590085)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=527834989:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2997 on theBenchmark for (2997ds/684Mi)
% 2.17/0.93  % TRYING [5]
% 2.17/0.93  % (1590086)ott-21_1_sil=16000:fs=off:random_seed=500332975:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 2.17/0.93  % (1590082)Instruction limit reached! 
% 2.17/0.93  % (1590082)------------------------------
% 2.17/0.93  % (1590082)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.93  % (1590082)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.93  % (1590082)CaDiCaL version: 2.1.3
% 2.17/0.93  % (1590082)Termination reason: Instruction limit
% 2.17/0.93  % (1590082)Termination phase: Saturation
% 2.17/0.93  % (1590082)Time elapsed: 0.132 s
% 2.17/0.93  % (1590082)Peak memory usage: 12 MB
% 2.17/0.93  % (1590082)Instructions burned: 132 (million)
% 2.17/0.93  % (1590085) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1590062-1590085"...
% 2.17/0.93  % (1590085)...printing done.
% 2.17/0.93  % (1590085)Refutation found. Thanks to Tanya!
% 2.17/0.93  % SZS status Unsatisfiable for theBenchmark
% 2.17/0.93  % SZS output start Proof for theBenchmark
% See solution above
% 2.17/0.93  % (1590085)------------------------------
% 2.17/0.93  % (1590085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.17/0.93  % (1590085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.17/0.93  % (1590085)CaDiCaL version: 2.1.3
% 2.17/0.93  % (1590085)Termination reason: Refutation
% 2.17/0.93  % (1590085)Time elapsed: 0.118 s
% 2.17/0.93  % (1590085)Peak memory usage: 12 MB
% 2.17/0.93  % (1590085)Instructions burned: 126 (million)
% 2.17/0.93  % (1590062)Success in time 0.387 s
% 2.17/0.93  % Vampire exiting
%------------------------------------------------------------------------------