↑ 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  : SWX199-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 01:46:42 PM UTC 2026

% Result   : Unsatisfiable 0.82s 0.40s
% Output   : Refutation 0.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   50 (  44 unt;   0 def)
%            Number of atoms       :   56 (  55 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   29 (  23   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   4 con; 0-5 aty)
%            Number of variables   :  124 ( 124   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] : aux(X0,X1,X2,X3,btrue) = cons(X0,merge(X1,cons(X2,X3))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).

fof(f3,axiom,
    ! [X0] : leqNat(z,X0) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).

fof(f4,plain,
    ! [X0] : btrue = leqNat(z,X0),
    inference(reorient_equations,[],[f3]) ).

fof(f7,axiom,
    ! [X0,X1] : leqNat(s(X0),s(X1)) = leqNat(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_004) ).

fof(f8,axiom,
    ! [X0] : merge(nil,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_005) ).

fof(f9,axiom,
    ! [X0,X1] : merge(cons(X0,X1),nil) = cons(X0,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_006) ).

fof(f10,plain,
    ! [X0,X1] : cons(X0,X1) = merge(cons(X0,X1),nil),
    inference(reorient_equations,[],[f9]) ).

fof(f11,axiom,
    ! [X2,X3,X0,X1] : merge(cons(X0,X1),cons(X2,X3)) = aux(X0,X1,X2,X3,leqNat(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_007) ).

fof(f12,axiom,
    ! [X0] : impl(btrue,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_008) ).

fof(f15,axiom,
    ! [X2,X0,X1] : prop_merge_comm(X0,X1,X2) = impl(eq(merge(X0,X1),merge(X1,X0)),impl(eq(merge(X0,X2),merge(X2,X0)),eq(merge(X1,X2),merge(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_010) ).

fof(f21,axiom,
    ! [X0] : eq2(z,s(X0)) = bfalse,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_014) ).

fof(f22,plain,
    ! [X0] : bfalse = eq2(z,s(X0)),
    inference(reorient_equations,[],[f21]) ).

fof(f25,axiom,
    ! [X0] : eq(X0,X0) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_016) ).

fof(f26,plain,
    ! [X0] : btrue = eq(X0,X0),
    inference(reorient_equations,[],[f25]) ).

fof(f27,axiom,
    ! [X0] : eq2(X0,X0) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_017) ).

fof(f28,plain,
    ! [X0] : btrue = eq2(X0,X0),
    inference(reorient_equations,[],[f27]) ).

fof(f29,axiom,
    ! [X0] : eq3(X0,X0) = btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_018) ).

fof(f30,plain,
    ! [X0] : btrue = eq3(X0,X0),
    inference(reorient_equations,[],[f29]) ).

fof(f31,axiom,
    ! [X2,X3,X0,X1] :
      ( eq2(X0,X1) != bfalse
      | eq(cons(X0,X2),cons(X1,X3)) = bfalse ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_019) ).

fof(f32,plain,
    ! [X2,X3,X0,X1] :
      ( bfalse != eq2(X0,X1)
      | bfalse = eq(cons(X0,X2),cons(X1,X3)) ),
    inference(reorient_equations,[],[f31]) ).

fof(f33,axiom,
    ! [X2,X3,X0,X1] :
      ( eq2(X0,X1) != btrue
      | eq(cons(X0,X2),cons(X1,X3)) = eq(X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_020) ).

fof(f34,plain,
    ! [X2,X3,X0,X1] :
      ( btrue != eq2(X0,X1)
      | eq(cons(X0,X2),cons(X1,X3)) = eq(X2,X3) ),
    inference(reorient_equations,[],[f33]) ).

fof(f39,negated_conjecture,
    ! [X2,X0,X1] : eq3(prop_merge_comm(X0,X1,X2),bfalse) != btrue,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

fof(f40,plain,
    ! [X2,X0,X1] : btrue != eq3(prop_merge_comm(X0,X1,X2),bfalse),
    inference(reorient_equations,[],[f39]) ).

fof(f41,plain,
    ! [X2,X0,X1] : btrue != eq3(impl(eq(merge(X0,X1),merge(X1,X0)),impl(eq(merge(X0,X2),merge(X2,X0)),eq(merge(X1,X2),merge(X2,X1)))),bfalse),
    inference(definition_unfolding,[],[f40,f15]) ).

fof(f81,plain,
    ! [X2,X0,X1] : btrue != eq3(impl(eq(merge(nil,X2),merge(X2,nil)),impl(eq(merge(nil,cons(X0,X1)),cons(X0,X1)),eq(merge(X2,cons(X0,X1)),merge(cons(X0,X1),X2)))),bfalse),
    inference(superposition,[],[f41,f10]) ).

fof(f90,plain,
    ! [X2,X0,X1] : btrue != eq3(impl(eq(merge(nil,X2),merge(X2,nil)),impl(eq(cons(X0,X1),cons(X0,X1)),eq(merge(X2,cons(X0,X1)),merge(cons(X0,X1),X2)))),bfalse),
    inference(forward_demodulation,[],[f81,f8]) ).

fof(f101,plain,
    ! [X2,X0,X1] : btrue != eq3(impl(eq(merge(nil,X2),merge(X2,nil)),impl(btrue,eq(merge(X2,cons(X0,X1)),merge(cons(X0,X1),X2)))),bfalse),
    inference(forward_demodulation,[],[f90,f26]) ).

fof(f112,plain,
    ! [X2,X0,X1] : btrue != eq3(impl(eq(merge(nil,X2),merge(X2,nil)),eq(merge(X2,cons(X0,X1)),merge(cons(X0,X1),X2))),bfalse),
    inference(forward_demodulation,[],[f101,f12]) ).

fof(f119,plain,
    ! [X2,X0,X1] : btrue != eq3(impl(eq(X2,merge(X2,nil)),eq(merge(X2,cons(X0,X1)),merge(cons(X0,X1),X2))),bfalse),
    inference(forward_demodulation,[],[f112,f8]) ).

fof(f152,plain,
    ! [X2,X0,X1] : aux(X2,nil,X0,X1,btrue) = cons(X2,cons(X0,X1)),
    inference(superposition,[],[f1,f8]) ).

fof(f181,plain,
    ! [X2,X0,X1] :
      ( bfalse != bfalse
      | bfalse = eq(cons(z,X1),cons(s(X0),X2)) ),
    inference(superposition,[],[f32,f22]) ).

fof(f185,plain,
    ! [X2,X0,X1] : bfalse = eq(cons(z,X1),cons(s(X0),X2)),
    inference(trivial_inequality_removal,[],[f181]) ).

fof(f186,plain,
    ! [X2,X0,X1] : merge(cons(z,X0),cons(X1,X2)) = aux(z,X0,X1,X2,btrue),
    inference(superposition,[],[f11,f4]) ).

fof(f188,plain,
    ! [X2,X3,X0,X1] : merge(cons(s(X0),X2),cons(s(X1),X3)) = aux(s(X0),X2,s(X1),X3,leqNat(X0,X1)),
    inference(superposition,[],[f11,f7]) ).

fof(f189,plain,
    ! [X2,X0,X1] :
      ( btrue != btrue
      | eq(cons(X0,X1),cons(X0,X2)) = eq(X1,X2) ),
    inference(superposition,[],[f34,f28]) ).

fof(f193,plain,
    ! [X2,X0,X1] : eq(cons(X0,X1),cons(X0,X2)) = eq(X1,X2),
    inference(trivial_inequality_removal,[],[f189]) ).

fof(f239,plain,
    ! [X2,X3,X0,X1] : btrue != eq3(impl(eq(cons(X0,X1),cons(X0,X1)),eq(merge(cons(X0,X1),cons(X2,X3)),merge(cons(X2,X3),cons(X0,X1)))),bfalse),
    inference(superposition,[],[f119,f10]) ).

fof(f248,plain,
    ! [X2,X3,X0,X1] : btrue != eq3(impl(btrue,eq(merge(cons(X0,X1),cons(X2,X3)),merge(cons(X2,X3),cons(X0,X1)))),bfalse),
    inference(forward_demodulation,[],[f239,f26]) ).

fof(f253,plain,
    ! [X2,X3,X0,X1] : btrue != eq3(eq(merge(cons(X0,X1),cons(X2,X3)),merge(cons(X2,X3),cons(X0,X1))),bfalse),
    inference(forward_demodulation,[],[f248,f12]) ).

fof(f552,plain,
    ! [X2,X3,X0,X1,X4] : bfalse = eq(aux(z,X0,X1,X2,btrue),cons(s(X3),X4)),
    inference(superposition,[],[f185,f1]) ).

fof(f556,plain,
    ! [X2,X3,X0,X1,X4] : eq(merge(X1,cons(X2,X3)),X4) = eq(aux(X0,X1,X2,X3,btrue),cons(X0,X4)),
    inference(superposition,[],[f193,f1]) ).

fof(f1233,plain,
    ! [X2,X0,X1] : merge(cons(s(z),X0),cons(s(X1),X2)) = aux(s(z),X0,s(X1),X2,btrue),
    inference(superposition,[],[f188,f4]) ).

fof(f4002,plain,
    ! [X2,X0,X1] : btrue != eq3(eq(merge(cons(s(X1),X2),cons(s(z),X0)),aux(s(z),X0,s(X1),X2,btrue)),bfalse),
    inference(superposition,[],[f253,f1233]) ).

fof(f8097,plain,
    ! [X0,X1] : btrue != eq3(eq(aux(s(z),X0,s(z),X1,btrue),aux(s(z),X1,s(z),X0,btrue)),bfalse),
    inference(superposition,[],[f4002,f1233]) ).

fof(f8151,plain,
    ! [X0] : btrue != eq3(eq(aux(s(z),X0,s(z),nil,btrue),cons(s(z),cons(s(z),X0))),bfalse),
    inference(superposition,[],[f8097,f152]) ).

fof(f8154,plain,
    ! [X0] : btrue != eq3(eq(merge(X0,cons(s(z),nil)),cons(s(z),X0)),bfalse),
    inference(forward_demodulation,[],[f8151,f556]) ).

fof(f8163,plain,
    ! [X0] : btrue != eq3(eq(aux(z,X0,s(z),nil,btrue),cons(s(z),cons(z,X0))),bfalse),
    inference(superposition,[],[f8154,f186]) ).

fof(f8174,plain,
    btrue != eq3(bfalse,bfalse),
    inference(forward_demodulation,[],[f8163,f552]) ).

fof(f8177,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f8174,f30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX199-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n010.cluster.edu
% 0.09/0.20  % Model    : x86_64 x86_64
% 0.09/0.20  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20  % Memory   : 8046.5625MB
% 0.09/0.20  % OS       : Linux 6.8.0-71-generic
% 0.09/0.20  % CPULimit : 300
% 0.09/0.20  % WCLimit  : 300
% 0.09/0.20  % DateTime : Mon Sep 28 15:08:33 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  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.82/0.40  % (1996091)Will run a generic schedule for satisfiability detection.
% 0.82/0.40  % (1996097)% WARNING: option uhcvi not known.
% 0.82/0.40  % (1996097)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3231344887:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.82/0.40  % (1996099)dis+10_1_sil=32000:sp=arity:random_seed=3303086213:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.82/0.40  % (1996101)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3293628105:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.82/0.40  % (1996098)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=261666299:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.82/0.40  % (1996100)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=202917361:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.82/0.40  % (1996096)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3893242600_2999 on theBenchmark for (2999ds/0Mi)
% 0.82/0.40  % (1996102)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1123582816:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.82/0.40  % TRYING [1]
% 0.82/0.40  % TRYING [2]
% 0.82/0.40  % TRYING [3]
% 0.82/0.40  % TRYING [4]
% 0.82/0.40  % (1996099)Instruction limit reached! 
% 0.82/0.40  % (1996099)------------------------------
% 0.82/0.40  % (1996099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.40  % (1996099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.40  % (1996099)CaDiCaL version: 2.1.3
% 0.82/0.40  % (1996099)Termination reason: Instruction limit
% 0.82/0.40  % (1996099)Termination phase: Saturation
% 0.82/0.40  % (1996099)Time elapsed: 0.058 s
% 0.82/0.40  % (1996099)Peak memory usage: 12 MB
% 0.82/0.40  % (1996099)Instructions burned: 104 (million)
% 0.82/0.40  % (1996100)Instruction limit reached! 
% 0.82/0.40  % (1996100)------------------------------
% 0.82/0.40  % (1996100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.40  % (1996100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.40  % (1996100)CaDiCaL version: 2.1.3
% 0.82/0.40  % (1996100)Termination reason: Instruction limit
% 0.82/0.40  % (1996100)Termination phase: Saturation
% 0.82/0.40  % (1996100)Time elapsed: 0.065 s
% 0.82/0.40  % (1996100)Peak memory usage: 13 MB
% 0.82/0.40  % (1996100)Instructions burned: 117 (million)
% 0.82/0.40  % (1996101)Instruction limit reached! 
% 0.82/0.40  % (1996101)------------------------------
% 0.82/0.40  % (1996101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.40  % (1996101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.40  % (1996101)CaDiCaL version: 2.1.3
% 0.82/0.40  % (1996101)Termination reason: Instruction limit
% 0.82/0.40  % (1996101)Termination phase: Saturation
% 0.82/0.40  % (1996101)Time elapsed: 0.074 s
% 0.82/0.40  % (1996101)Peak memory usage: 13 MB
% 0.82/0.40  % (1996101)Instructions burned: 133 (million)
% 0.82/0.40  % (1996110)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2213121538:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.82/0.40  % TRYING [5]
% 0.82/0.40  % TRYING [1]
% 0.82/0.40  % TRYING [2]
% 0.82/0.40  % (1996111)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3154761614:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.82/0.40  % TRYING [3]
% 0.82/0.40  % (1996112)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=3285312418:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.82/0.40  % (1996102)Instruction limit reached! 
% 0.82/0.40  % (1996102)------------------------------
% 0.82/0.40  % (1996102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.40  % (1996102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.40  % (1996102)CaDiCaL version: 2.1.3
% 0.82/0.40  % (1996102)Termination reason: Instruction limit
% 0.82/0.40  % (1996102)Termination phase: Saturation
% 0.82/0.40  % (1996102)Time elapsed: 0.093 s
% 0.82/0.40  % (1996102)Peak memory usage: 12 MB
% 0.82/0.40  % (1996102)Instructions burned: 159 (million)
% 0.82/0.40  % TRYING [4]
% 0.82/0.40  % (1996097) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1996091-1996097"...
% 0.82/0.40  % (1996097)...printing done.
% 0.82/0.40  % (1996097)Refutation found. Thanks to Tanya!
% 0.82/0.40  % SZS status Unsatisfiable for theBenchmark
% 0.82/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.82/0.40  % (1996097)------------------------------
% 0.82/0.40  % (1996097)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.40  % (1996097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.40  % (1996097)CaDiCaL version: 2.1.3
% 0.82/0.40  % (1996097)Termination reason: Refutation
% 0.82/0.40  % (1996097)Time elapsed: 0.127 s
% 0.82/0.40  % (1996097)Peak memory usage: 16 MB
% 0.82/0.40  % (1996097)Instructions burned: 440 (million)
% 0.82/0.40  % (1996091)Success in time 0.162 s
% 0.82/0.40  % Vampire exiting
%------------------------------------------------------------------------------