↑ 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  : ROB023-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 : n011.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 12:36:22 PM UTC 2026

% Result   : Unsatisfiable 0.99s 0.60s
% Output   : Refutation 0.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   47 (  47 unt;   0 def)
%            Number of atoms       :   47 (  46 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   68 (  68   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).

fof(f2,axiom,
    ! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).

fof(f3,axiom,
    ! [X0,X1] : negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

fof(f4,axiom,
    ! [X0] : add(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_plus_x_is_x) ).

fof(f5,negated_conjecture,
    add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_huntingtons_axiom) ).

fof(f6,plain,
    b != add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),
    inference(reorient_equations,[],[f5]) ).

fof(f7,plain,
    ! [X0,X1] : add(X0,X1) = add(X0,add(X0,X1)),
    inference(superposition,[],[f2,f4]) ).

fof(f9,plain,
    ! [X2,X0,X1] : add(add(X0,X1),X2) = add(X1,add(X0,X2)),
    inference(superposition,[],[f2,f1]) ).

fof(f16,plain,
    ! [X2,X0,X1] : add(X0,add(X1,X2)) = add(X2,add(X0,X1)),
    inference(superposition,[],[f1,f2]) ).

fof(f21,plain,
    ! [X0,X1] : add(X0,X1) = add(X1,add(X0,X1)),
    inference(superposition,[],[f7,f1]) ).

fof(f35,plain,
    ! [X0] : negate(add(negate(X0),negate(add(X0,negate(X0))))) = X0,
    inference(superposition,[],[f3,f4]) ).

fof(f42,plain,
    ! [X0] : negate(X0) = negate(add(negate(add(negate(X0),X0)),negate(negate(X0)))),
    inference(superposition,[],[f3,f4]) ).

fof(f44,plain,
    ! [X0,X1] : negate(add(negate(add(X1,X0)),negate(add(negate(X0),X1)))) = X1,
    inference(superposition,[],[f3,f1]) ).

fof(f49,plain,
    ! [X0] : negate(X0) = negate(add(negate(negate(X0)),negate(add(negate(X0),X0)))),
    inference(forward_demodulation,[],[f42,f1]) ).

fof(f53,plain,
    ! [X0] : negate(X0) = negate(add(negate(negate(X0)),negate(add(X0,negate(X0))))),
    inference(forward_demodulation,[],[f49,f1]) ).

fof(f71,plain,
    ! [X0] : add(negate(X0),negate(add(X0,negate(X0)))) = negate(add(X0,negate(add(add(negate(X0),negate(add(X0,negate(X0)))),X0)))),
    inference(superposition,[],[f35,f35]) ).

fof(f73,plain,
    ! [X0] : negate(X0) = negate(add(negate(add(negate(X0),add(X0,negate(X0)))),X0)),
    inference(superposition,[],[f3,f35]) ).

fof(f77,plain,
    ! [X0] : negate(X0) = negate(add(X0,negate(add(negate(X0),add(X0,negate(X0)))))),
    inference(forward_demodulation,[],[f73,f1]) ).

fof(f78,plain,
    ! [X0] : add(negate(X0),negate(add(X0,negate(X0)))) = negate(add(X0,negate(add(X0,add(negate(X0),negate(add(X0,negate(X0)))))))),
    inference(forward_demodulation,[],[f71,f1]) ).

fof(f80,plain,
    ! [X0] : negate(X0) = negate(add(X0,negate(add(X0,add(negate(X0),negate(X0)))))),
    inference(forward_demodulation,[],[f77,f16]) ).

fof(f81,plain,
    ! [X0] : negate(X0) = negate(add(X0,negate(add(X0,negate(X0))))),
    inference(forward_demodulation,[],[f80,f4]) ).

fof(f170,plain,
    ! [X0,X1] : add(X1,X0) = add(X0,add(X0,X1)),
    inference(superposition,[],[f21,f16]) ).

fof(f300,plain,
    ! [X0] : negate(add(negate(X0),negate(add(add(negate(X0),negate(add(X0,negate(X0)))),X0)))) = X0,
    inference(superposition,[],[f53,f35]) ).

fof(f312,plain,
    ! [X0] : negate(add(negate(X0),negate(add(X0,add(negate(X0),negate(add(X0,negate(X0)))))))) = X0,
    inference(forward_demodulation,[],[f300,f1]) ).

fof(f472,plain,
    ! [X0] : add(X0,negate(add(X0,negate(X0)))) = negate(add(negate(X0),negate(add(add(X0,negate(add(X0,negate(X0)))),negate(X0))))),
    inference(superposition,[],[f35,f81]) ).

fof(f475,plain,
    ! [X0] : add(X0,negate(add(X0,negate(X0)))) = negate(add(negate(X0),negate(add(negate(X0),add(X0,negate(add(X0,negate(X0)))))))),
    inference(forward_demodulation,[],[f472,f1]) ).

fof(f490,plain,
    ! [X0] : add(X0,negate(add(X0,negate(X0)))) = negate(add(negate(X0),negate(add(X0,add(negate(add(X0,negate(X0))),negate(X0)))))),
    inference(forward_demodulation,[],[f475,f16]) ).

fof(f501,plain,
    ! [X0] : add(X0,negate(add(X0,negate(X0)))) = negate(add(negate(X0),negate(add(X0,add(negate(X0),negate(add(X0,negate(X0)))))))),
    inference(forward_demodulation,[],[f490,f1]) ).

fof(f505,plain,
    ! [X0] : add(X0,negate(add(X0,negate(X0)))) = X0,
    inference(forward_demodulation,[],[f501,f312]) ).

fof(f543,plain,
    ! [X0,X1] : negate(add(negate(X1),X0)) = negate(add(negate(add(negate(add(negate(X1),X0)),add(X0,X1))),X0)),
    inference(superposition,[],[f44,f44]) ).

fof(f559,plain,
    ! [X0,X1] : negate(add(negate(X1),X0)) = negate(add(X0,negate(add(negate(add(negate(X1),X0)),add(X0,X1))))),
    inference(forward_demodulation,[],[f543,f1]) ).

fof(f589,plain,
    ! [X0,X1] : negate(add(negate(X1),X0)) = negate(add(X0,negate(add(add(X0,X1),negate(add(negate(X1),X0)))))),
    inference(forward_demodulation,[],[f559,f1]) ).

fof(f601,plain,
    ! [X0,X1] : negate(add(negate(X1),X0)) = negate(add(X0,negate(add(X0,add(X1,negate(add(negate(X1),X0))))))),
    inference(forward_demodulation,[],[f589,f2]) ).

fof(f620,plain,
    ! [X0,X1] : add(X0,X1) = add(negate(add(X0,negate(X0))),add(X0,X1)),
    inference(superposition,[],[f9,f505]) ).

fof(f640,plain,
    ! [X0,X1] : add(X0,X1) = add(X0,add(X1,negate(add(X0,negate(X0))))),
    inference(forward_demodulation,[],[f620,f16]) ).

fof(f660,plain,
    ! [X0] : add(negate(X0),negate(add(X0,negate(X0)))) = negate(add(X0,negate(add(X0,negate(X0))))),
    inference(backward_demodulation,[],[f78,f640]) ).

fof(f669,plain,
    ! [X0] : negate(X0) = add(negate(X0),negate(add(X0,negate(X0)))),
    inference(forward_demodulation,[],[f660,f505]) ).

fof(f676,plain,
    ! [X0] : negate(negate(X0)) = X0,
    inference(backward_demodulation,[],[f35,f669]) ).

fof(f747,plain,
    ! [X0,X1] : add(negate(add(X0,X1)),negate(add(X0,negate(X1)))) = negate(X0),
    inference(superposition,[],[f676,f3]) ).

fof(f2157,plain,
    ! [X0,X1] : negate(X1) = add(negate(add(X0,X1)),negate(add(X1,negate(add(X1,X0))))),
    inference(superposition,[],[f747,f170]) ).

fof(f2188,plain,
    ! [X0,X1] : negate(X0) = add(negate(add(X0,X1)),negate(X0)),
    inference(superposition,[],[f7,f747]) ).

fof(f2215,plain,
    ! [X0,X1] : negate(X0) = add(negate(X0),negate(add(X0,X1))),
    inference(forward_demodulation,[],[f2188,f1]) ).

fof(f2264,plain,
    ! [X0,X1] : add(X0,negate(add(negate(X0),X1))) = X0,
    inference(superposition,[],[f2215,f676]) ).

fof(f2324,plain,
    ! [X0,X1] : negate(add(X0,negate(add(X0,X1)))) = negate(add(negate(X1),X0)),
    inference(backward_demodulation,[],[f601,f2264]) ).

fof(f2331,plain,
    ! [X0,X1] : negate(X1) = add(negate(add(X0,X1)),negate(add(negate(X0),X1))),
    inference(backward_demodulation,[],[f2157,f2324]) ).

fof(f2343,plain,
    b != negate(negate(b)),
    inference(backward_demodulation,[],[f6,f2331]) ).

fof(f2345,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2343,f676]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ROB023-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n011.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 23:27:45 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/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
% 0.99/0.60  % (2877510)Will run a generic schedule for satisfiability detection.
% 0.99/0.60  % (2877515)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3400208319_2999 on theBenchmark for (2999ds/0Mi)
% 0.99/0.60  % TRYING [1]
% 0.99/0.60  % TRYING [2]
% 0.99/0.60  % TRYING [3]
% 0.99/0.60  % (2877516)% WARNING: option uhcvi not known.
% 0.99/0.60  % TRYING [4]
% 0.99/0.60  % (2877516)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=21953470:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.99/0.60  % (2877517)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=391660723:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.99/0.60  % (2877518)dis+10_1_sil=32000:sp=arity:random_seed=3905530609:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.99/0.60  % (2877520)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2075624193:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.99/0.60  % (2877519)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1470408156:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.99/0.60  % (2877521)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3053107006:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.99/0.60  % TRYING [5]
% 0.99/0.60  % (2877518)Instruction limit reached! 
% 0.99/0.60  % (2877518)------------------------------
% 0.99/0.60  % (2877518)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.60  % (2877518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.60  % (2877518)CaDiCaL version: 2.1.3
% 0.99/0.60  % (2877518)Termination reason: Instruction limit
% 0.99/0.60  % (2877518)Termination phase: Saturation
% 0.99/0.60  % (2877518)Time elapsed: 0.054 s
% 0.99/0.60  % (2877518)Peak memory usage: 12 MB
% 0.99/0.60  % (2877518)Instructions burned: 103 (million)
% 0.99/0.60  % (2877519)Instruction limit reached! 
% 0.99/0.60  % (2877519)------------------------------
% 0.99/0.60  % (2877519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.60  % (2877519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.60  % (2877519)CaDiCaL version: 2.1.3
% 0.99/0.60  % (2877519)Termination reason: Instruction limit
% 0.99/0.60  % (2877519)Termination phase: Saturation
% 0.99/0.60  % (2877519)Time elapsed: 0.063 s
% 0.99/0.60  % (2877519)Peak memory usage: 12 MB
% 0.99/0.60  % (2877519)Instructions burned: 116 (million)
% 0.99/0.60  % (2877520)Instruction limit reached! 
% 0.99/0.60  % (2877520)------------------------------
% 0.99/0.60  % (2877520)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.60  % (2877520)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.60  % (2877520)CaDiCaL version: 2.1.3
% 0.99/0.60  % (2877520)Termination reason: Instruction limit
% 0.99/0.60  % (2877520)Termination phase: Saturation
% 0.99/0.60  % (2877520)Time elapsed: 0.072 s
% 0.99/0.60  % (2877520)Peak memory usage: 12 MB
% 0.99/0.60  % (2877520)Instructions burned: 131 (million)
% 0.99/0.60  % (2877529)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=39170524:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.99/0.60  % TRYING [1]
% 0.99/0.60  % TRYING [2]
% 0.99/0.60  % TRYING [3]
% 0.99/0.60  % TRYING [4]
% 0.99/0.60  % (2877530)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4191551949:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.99/0.60  % (2877521)Instruction limit reached! 
% 0.99/0.60  % (2877521)------------------------------
% 0.99/0.60  % (2877521)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.60  % (2877521)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.60  % (2877521)CaDiCaL version: 2.1.3
% 0.99/0.60  % (2877521)Termination reason: Instruction limit
% 0.99/0.60  % (2877521)Termination phase: Saturation
% 0.99/0.60  % (2877521)Time elapsed: 0.089 s
% 0.99/0.60  % (2877521)Peak memory usage: 12 MB
% 0.99/0.60  % (2877521)Instructions burned: 160 (million)
% 0.99/0.60  % (2877531)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=3924489421:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.99/0.60  % TRYING [6]
% 0.99/0.60  % TRYING [5]
% 0.99/0.60  % (2877534)ott-21_1_sil=16000:fs=off:random_seed=3112503017:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.99/0.60  % (2877530) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2877510-2877530"...
% 0.99/0.60  % (2877530)...printing done.
% 0.99/0.60  % (2877530)Refutation found. Thanks to Tanya!
% 0.99/0.60  % SZS status Unsatisfiable for theBenchmark
% 0.99/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 0.99/0.60  % (2877530)------------------------------
% 0.99/0.60  % (2877530)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.99/0.60  % (2877530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.99/0.60  % (2877530)CaDiCaL version: 2.1.3
% 0.99/0.60  % (2877530)Termination reason: Refutation
% 0.99/0.60  % (2877530)Time elapsed: 0.064 s
% 0.99/0.60  % (2877530)Peak memory usage: 12 MB
% 0.99/0.60  % (2877530)Instructions burned: 111 (million)
% 0.99/0.60  % (2877510)Success in time 0.186 s
% 0.99/0.60  % Vampire exiting
%------------------------------------------------------------------------------