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

% Computer : n010.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:04 AM UTC 2026

% Result   : Unsatisfiable 2.49s 0.95s
% Output   : Refutation 2.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   40 (  14 unt;   0 def)
%            Number of atoms       :   72 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   69 (  37   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   72 (  72   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

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

fof(f7,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ axiom(or(not(X1),X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( theorem(or(not(X0),X1))
      | ~ axiom(or(not(X0),X2))
      | ~ theorem(or(not(X2),X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ! [X0] :
      ( ~ theorem(X0)
      | ~ axiom(X0) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),X0))
      | ~ theorem(X0)
      | theorem(X1) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f12,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X0),X1))
      | ~ axiom(or(not(X0),X2))
      | theorem(or(not(X2),X1)) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f13,plain,
    theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
    inference(consistent_polarity_flipping,[],[f9]) ).

fof(f15,plain,
    ! [X0] :
      ( theorem(or(X0,X0))
      | ~ theorem(X0) ),
    inference(resolution,[],[f11,f1]) ).

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

fof(f17,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,X1))
      | theorem(X1) ),
    inference(resolution,[],[f11,f2]) ).

fof(f18,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X0,or(X1,X2)))
      | theorem(or(X1,or(X0,X2))) ),
    inference(resolution,[],[f4,f11]) ).

fof(f19,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),or(X0,X2)))
      | theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f5,f11]) ).

fof(f21,plain,
    ! [X0] :
      ( theorem(or(not(X0),or(not(or(p,q)),or(p,r))))
      | ~ axiom(or(not(or(p,or(not(q),r))),X0)) ),
    inference(resolution,[],[f12,f13]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(or(p,or(not(q),r))),X0))
      | ~ axiom(or(not(X0),X1))
      | theorem(or(not(X1),or(not(or(p,q)),or(p,r)))) ),
    inference(resolution,[],[f21,f12]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( theorem(or(X0,or(or(X0,X1),X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f18,f15]) ).

fof(f76,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(not(q),or(p,r))),X0))
      | theorem(or(not(X0),or(not(or(p,q)),or(p,r)))) ),
    inference(resolution,[],[f23,f4]) ).

fof(f80,plain,
    ! [X2,X0,X1] :
      ( ~ axiom(or(not(X0),X2))
      | ~ theorem(or(not(X0),X1))
      | theorem(or(not(X2),or(or(not(X0),X1),X1))) ),
    inference(resolution,[],[f45,f12]) ).

fof(f82,plain,
    ! [X0,X1] :
      ( theorem(or(or(X0,X1),X1))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f45,f17]) ).

fof(f142,plain,
    ! [X0] : theorem(or(not(or(not(or(X0,q)),or(X0,or(p,r)))),or(not(or(p,q)),or(p,r)))),
    inference(resolution,[],[f76,f5]) ).

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

fof(f176,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X1,X0)),or(or(not(or(X0,X1)),X2),X2)))
      | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[],[f80,f3]) ).

fof(f179,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X2,X0)),or(or(not(X0),X1),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f80,f2]) ).

fof(f306,plain,
    theorem(or(not(or(p,or(p,r))),or(p,r))),
    inference(resolution,[],[f142,f19]) ).

fof(f383,plain,
    ! [X0,X1] :
      ( theorem(or(X0,or(X1,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f161,f18]) ).

fof(f399,plain,
    ! [X2,X0,X1] :
      ( theorem(or(or(not(X0),X1),or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f179,f18]) ).

fof(f429,plain,
    ! [X2,X0,X1] :
      ( ~ axiom(or(not(or(X1,X0)),or(or(not(or(X0,X1)),X2),X2)))
      | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[],[f176,f10]) ).

fof(f483,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(p,or(p,r))),X0))
      | theorem(or(not(X0),or(p,r))) ),
    inference(resolution,[],[f306,f12]) ).

fof(f937,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X0))
      | theorem(or(not(X1),X0)) ),
    inference(resolution,[],[f383,f19]) ).

fof(f1194,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X2,X0)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f399,f17]) ).

fof(f1279,plain,
    ! [X0,X1] : ~ theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f429,f2]) ).

fof(f1613,plain,
    theorem(or(not(or(or(p,r),p)),or(p,r))),
    inference(resolution,[],[f483,f3]) ).

fof(f3519,plain,
    theorem(or(not(p),or(p,r))),
    inference(resolution,[],[f937,f1613]) ).

fof(f4066,plain,
    ! [X0,X1] : ~ theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f1194,f1279]) ).

fof(f17435,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f3519,f4066]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL224-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n010.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.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 15:28:17 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41  Running first-order model finding
% 0.10/0.41  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
% 2.49/0.95  % (1097502)Will run a generic schedule for satisfiability detection.
% 2.49/0.95  % (1097508)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1757509712_2999 on theBenchmark for (2999ds/0Mi)
% 2.49/0.95  % TRYING [1]
% 2.49/0.95  % TRYING [2]
% 2.49/0.95  % (1097509)% WARNING: option uhcvi not known.
% 2.49/0.95  % TRYING [3]
% 2.49/0.95  % (1097509)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1820513634:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.49/0.95  % (1097510)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1913204939:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.49/0.95  % (1097511)dis+10_1_sil=32000:sp=arity:random_seed=3361793534:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.49/0.95  % (1097512)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1551316773:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.49/0.95  % TRYING [4]
% 2.49/0.95  % (1097513)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=413503593:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.49/0.95  % (1097514)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1749129682:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.49/0.95  % (1097512)Instruction limit reached! 
% 2.49/0.95  % (1097512)------------------------------
% 2.49/0.95  % (1097512)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097512)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097512)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097512)Termination reason: Instruction limit
% 2.49/0.95  % (1097512)Termination phase: Saturation
% 2.49/0.95  % (1097512)Time elapsed: 0.084 s
% 2.49/0.95  % (1097512)Peak memory usage: 11 MB
% 2.49/0.95  % (1097512)Instructions burned: 117 (million)
% 2.49/0.95  % (1097511)Instruction limit reached! 
% 2.49/0.95  % (1097511)------------------------------
% 2.49/0.95  % (1097511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097511)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097511)Termination reason: Instruction limit
% 2.49/0.95  % (1097511)Termination phase: Saturation
% 2.49/0.95  % (1097511)Time elapsed: 0.094 s
% 2.49/0.95  % (1097511)Peak memory usage: 11 MB
% 2.49/0.95  % (1097511)Instructions burned: 104 (million)
% 2.49/0.95  % (1097529)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2514274188:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 2.49/0.95  % TRYING [1]
% 2.49/0.95  % TRYING [2]
% 2.49/0.95  % TRYING [3]
% 2.49/0.95  % (1097530)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2833647512:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 2.49/0.95  % TRYING [4]
% 2.49/0.95  % (1097514)Instruction limit reached! 
% 2.49/0.95  % (1097514)------------------------------
% 2.49/0.95  % (1097514)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097514)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097514)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097514)Termination reason: Instruction limit
% 2.49/0.95  % (1097514)Termination phase: Saturation
% 2.49/0.95  % (1097514)Time elapsed: 0.146 s
% 2.49/0.95  % (1097514)Peak memory usage: 12 MB
% 2.49/0.95  % (1097514)Instructions burned: 159 (million)
% 2.49/0.95  % (1097513)Instruction limit reached! 
% 2.49/0.95  % (1097513)------------------------------
% 2.49/0.95  % (1097513)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097513)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097513)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097513)Termination reason: Instruction limit
% 2.49/0.95  % (1097513)Termination phase: Saturation
% 2.49/0.95  % (1097513)Time elapsed: 0.183 s
% 2.49/0.95  % (1097513)Peak memory usage: 12 MB
% 2.49/0.95  % (1097513)Instructions burned: 131 (million)
% 2.49/0.95  % (1097534)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=4203032782:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2997 on theBenchmark for (2997ds/684Mi)
% 2.49/0.95  % (1097541)ott-21_1_sil=16000:fs=off:random_seed=3627457501:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 2.49/0.95  % (1097530)Instruction limit reached! 
% 2.49/0.95  % (1097530)------------------------------
% 2.49/0.95  % (1097530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097530)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097530)Termination reason: Instruction limit
% 2.49/0.95  % (1097530)Termination phase: Saturation
% 2.49/0.95  % (1097530)Time elapsed: 0.131 s
% 2.49/0.95  % (1097530)Peak memory usage: 12 MB
% 2.49/0.95  % (1097530)Instructions burned: 131 (million)
% 2.49/0.95  % (1097544)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=246865562:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 2.49/0.95  % (1097541)Instruction limit reached! 
% 2.49/0.95  % (1097541)------------------------------
% 2.49/0.95  % (1097541)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097541)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097541)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097541)Termination reason: Instruction limit
% 2.49/0.95  % (1097541)Termination phase: Saturation
% 2.49/0.95  % (1097541)Time elapsed: 0.166 s
% 2.49/0.95  % (1097541)Peak memory usage: 12 MB
% 2.49/0.95  % (1097541)Instructions burned: 180 (million)
% 2.49/0.95  % (1097550)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3376373541:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 2.49/0.95  % TRYING [1]
% 2.49/0.95  % TRYING [2]
% 2.49/0.95  % TRYING [3]
% 2.49/0.95  % (1097509) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1097502-1097509"...
% 2.49/0.95  % (1097509)...printing done.
% 2.49/0.95  % (1097509)Refutation found. Thanks to Tanya!
% 2.49/0.95  % SZS status Unsatisfiable for theBenchmark
% 2.49/0.95  % SZS output start Proof for theBenchmark
% See solution above
% 2.49/0.95  % (1097509)------------------------------
% 2.49/0.95  % (1097509)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.49/0.95  % (1097509)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.95  % (1097509)CaDiCaL version: 2.1.3
% 2.49/0.95  % (1097509)Termination reason: Refutation
% 2.49/0.95  % (1097509)Time elapsed: 0.482 s
% 2.49/0.95  % (1097509)Peak memory usage: 15 MB
% 2.49/0.95  % (1097509)Instructions burned: 486 (million)
% 2.49/0.95  % (1097502)Success in time 0.528 s
% 2.49/0.95  % Vampire exiting
%------------------------------------------------------------------------------