↑ 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  : BOO074-1 : TPTP v9.3.1. Released v2.6.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 09:36:17 AM UTC 2026

% Result   : Unsatisfiable 1.69s 0.51s
% Output   : Refutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   45 (  45 unt;   0 def)
%            Number of atoms       :   45 (  44 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :   15 (   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   :   84 (  84   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1] : inverse(add(inverse(add(inverse(add(X0,X1)),X2)),inverse(add(X0,inverse(add(inverse(X2),inverse(add(X2,X3)))))))) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dn1) ).

fof(f2,negated_conjecture,
    add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',huntinton_3) ).

fof(f3,plain,
    a != add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))),
    inference(reorient_equations,[],[f2]) ).

fof(f4,plain,
    ! [X2,X0,X1,X4,X5] : inverse(add(inverse(add(X0,X4)),inverse(add(inverse(add(inverse(add(X1,X2)),X0)),inverse(add(inverse(X4),inverse(add(X4,X5)))))))) = X4,
    inference(superposition,[],[f1,f1]) ).

fof(f5,plain,
    ! [X2,X3,X0,X1,X4] : inverse(add(X1,inverse(add(inverse(X0),inverse(add(X0,X3)))))) = inverse(add(X0,inverse(add(inverse(add(X1,X2)),inverse(add(inverse(inverse(add(X1,inverse(add(inverse(X0),inverse(add(X0,X3))))))),inverse(add(inverse(add(X1,inverse(add(inverse(X0),inverse(add(X0,X3)))))),X4)))))))),
    inference(superposition,[],[f1,f1]) ).

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

fof(f9,plain,
    ! [X0] : inverse(X0) = inverse(add(inverse(add(X0,inverse(X0))),X0)),
    inference(superposition,[],[f8,f1]) ).

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

fof(f68,plain,
    ! [X2,X0,X1] : inverse(add(inverse(add(inverse(add(X1,X2)),X0)),inverse(add(X1,X0)))) = X0,
    inference(superposition,[],[f1,f20]) ).

fof(f110,plain,
    ! [X0,X1,X5] : inverse(add(inverse(add(X0,X5)),inverse(add(inverse(add(X1,X0)),X5)))) = X5,
    inference(superposition,[],[f68,f4]) ).

fof(f111,plain,
    ! [X2,X0] : inverse(add(inverse(add(X0,X2)),inverse(add(inverse(X0),X2)))) = X2,
    inference(superposition,[],[f68,f20]) ).

fof(f127,plain,
    ! [X0,X1] : inverse(add(inverse(add(inverse(add(X0,X1)),X0)),inverse(add(X0,X1)))) = X0,
    inference(superposition,[],[f4,f68]) ).

fof(f163,plain,
    ! [X0] : inverse(add(inverse(add(add(X0,inverse(X0)),X0)),inverse(X0))) = X0,
    inference(superposition,[],[f111,f9]) ).

fof(f197,plain,
    ! [X0] : inverse(X0) = inverse(add(X0,inverse(add(add(X0,inverse(X0)),inverse(X0))))),
    inference(superposition,[],[f68,f163]) ).

fof(f240,plain,
    ! [X0,X1] : inverse(add(inverse(add(inverse(X0),X1)),inverse(add(X0,X1)))) = X1,
    inference(superposition,[],[f68,f197]) ).

fof(f375,plain,
    ! [X0] : inverse(add(inverse(add(inverse(X0),X0)),inverse(X0))) = X0,
    inference(superposition,[],[f110,f8]) ).

fof(f431,plain,
    ! [X0] : inverse(X0) = inverse(add(X0,inverse(add(inverse(X0),inverse(X0))))),
    inference(superposition,[],[f68,f375]) ).

fof(f488,plain,
    ! [X0] : inverse(add(inverse(X0),inverse(add(X0,inverse(add(inverse(X0),inverse(X0))))))) = X0,
    inference(superposition,[],[f20,f431]) ).

fof(f507,plain,
    ! [X0] : inverse(add(inverse(X0),inverse(X0))) = X0,
    inference(forward_demodulation,[],[f488,f431]) ).

fof(f523,plain,
    ! [X0] : inverse(add(inverse(X0),inverse(X0))) = add(X0,inverse(add(inverse(X0),inverse(X0)))),
    inference(superposition,[],[f507,f431]) ).

fof(f561,plain,
    ! [X0] : add(X0,X0) = X0,
    inference(forward_demodulation,[],[f523,f507]) ).

fof(f565,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f507,f561]) ).

fof(f583,plain,
    ! [X0,X1] : inverse(add(inverse(add(inverse(add(X0,X1)),X0)),inverse(X0))) = X0,
    inference(superposition,[],[f68,f561]) ).

fof(f596,plain,
    ! [X0,X1] : inverse(X0) = add(inverse(add(inverse(X1),X0)),inverse(add(X1,X0))),
    inference(superposition,[],[f565,f240]) ).

fof(f1150,plain,
    ! [X0,X1] : inverse(add(X1,X0)) = inverse(add(X0,inverse(inverse(add(X1,X0))))),
    inference(superposition,[],[f583,f68]) ).

fof(f1235,plain,
    ! [X0,X1] : inverse(add(X1,X0)) = inverse(add(X0,add(X1,X0))),
    inference(forward_demodulation,[],[f1150,f565]) ).

fof(f1305,plain,
    ! [X0,X1] : inverse(inverse(add(X0,X1))) = add(X1,add(X0,X1)),
    inference(superposition,[],[f565,f1235]) ).

fof(f1311,plain,
    ! [X0,X1] : add(X0,X1) = add(X1,add(X0,X1)),
    inference(forward_demodulation,[],[f1305,f565]) ).

fof(f1755,plain,
    ! [X0,X1] : inverse(X0) = add(inverse(add(X1,X0)),inverse(X0)),
    inference(superposition,[],[f1311,f596]) ).

fof(f2111,plain,
    ! [X0,X1] : add(inverse(add(X1,inverse(X0))),X0) = X0,
    inference(superposition,[],[f1755,f565]) ).

fof(f2272,plain,
    ! [X0,X1] : inverse(add(inverse(X0),inverse(add(X1,X0)))) = X0,
    inference(superposition,[],[f68,f2111]) ).

fof(f2444,plain,
    ! [X0,X1] : inverse(X0) = add(inverse(X0),inverse(add(X1,X0))),
    inference(superposition,[],[f565,f2272]) ).

fof(f3524,plain,
    ! [X0,X1] : inverse(inverse(add(X0,X1))) = add(inverse(inverse(add(X0,X1))),X0),
    inference(superposition,[],[f2444,f127]) ).

fof(f3567,plain,
    ! [X0,X1] : add(X0,X1) = add(add(X0,X1),X0),
    inference(forward_demodulation,[],[f3524,f565]) ).

fof(f3695,plain,
    ! [X0,X1] : inverse(add(inverse(X0),inverse(add(X0,X1)))) = X0,
    inference(superposition,[],[f2272,f3567]) ).

fof(f4826,plain,
    ! [X2,X3,X0,X1] : inverse(add(X1,inverse(add(inverse(X0),inverse(add(X0,X3)))))) = inverse(add(X0,inverse(add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(inverse(X0),inverse(add(X0,X3)))))))))),
    inference(forward_demodulation,[],[f5,f3695]) ).

fof(f4827,plain,
    ! [X2,X0,X1] : inverse(add(X1,X0)) = inverse(add(X0,inverse(add(inverse(add(X1,X2)),inverse(add(X1,X0)))))),
    inference(forward_demodulation,[],[f4826,f3695]) ).

fof(f4881,plain,
    ! [X0,X1] : inverse(add(X0,X1)) = inverse(add(X1,inverse(add(inverse(X0),inverse(add(X0,X1)))))),
    inference(superposition,[],[f4827,f431]) ).

fof(f5096,plain,
    ! [X0,X1] : inverse(add(X0,X1)) = inverse(add(X1,X0)),
    inference(forward_demodulation,[],[f4881,f3695]) ).

fof(f5192,plain,
    ! [X0,X1] : inverse(add(inverse(add(X1,X0)),inverse(add(X0,inverse(X1))))) = X0,
    inference(superposition,[],[f111,f5096]) ).

fof(f5220,plain,
    a != add(inverse(add(b,inverse(a))),inverse(add(inverse(a),inverse(b)))),
    inference(superposition,[],[f3,f5096]) ).

fof(f5995,plain,
    ! [X0,X1] : inverse(add(X0,X0)) = add(inverse(add(X1,X0)),inverse(add(X0,inverse(X1)))),
    inference(superposition,[],[f507,f5192]) ).

fof(f6035,plain,
    ! [X0,X1] : inverse(X0) = add(inverse(add(X1,X0)),inverse(add(X0,inverse(X1)))),
    inference(forward_demodulation,[],[f5995,f561]) ).

fof(f8142,plain,
    a != inverse(inverse(a)),
    inference(superposition,[],[f5220,f6035]) ).

fof(f8254,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f8142,f565]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : BOO074-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20  % Computer : n005.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 21:07:46 UTC 2026
% 0.09/0.21  % CPUTime  : 
% 0.09/0.21  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.24  Running first-order model finding
% 0.09/0.24  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
% 1.69/0.51  % (1178198)Will run a generic schedule for satisfiability detection.
% 1.69/0.51  % (1178207)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2046262723:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.69/0.51  % (1178204)% WARNING: option uhcvi not known.
% 1.69/0.51  % (1178203)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4292086421_2999 on theBenchmark for (2999ds/0Mi)
% 1.69/0.51  % (1178206)dis+10_1_sil=32000:sp=arity:random_seed=934578894:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.69/0.51  % (1178205)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=392415629:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.69/0.51  % (1178204)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1076350631:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.69/0.51  % (1178208)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1637136885:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.51  % (1178209)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3403955829:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.69/0.51  % TRYING [1]
% 1.69/0.51  % TRYING [2]
% 1.69/0.51  % TRYING [3]
% 1.69/0.51  % (1178207)Instruction limit reached! 
% 1.69/0.51  % (1178207)------------------------------
% 1.69/0.51  % (1178207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.51  % (1178207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.51  % (1178207)CaDiCaL version: 2.1.3
% 1.69/0.51  % (1178207)Termination reason: Instruction limit
% 1.69/0.51  % (1178207)Termination phase: Saturation
% 1.69/0.51  % (1178207)Time elapsed: 0.038 s
% 1.69/0.51  % (1178207)Peak memory usage: 13 MB
% 1.69/0.51  % (1178207)Instructions burned: 119 (million)
% 1.69/0.51  % (1178217)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4169129417:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.69/0.51  % TRYING [1]
% 1.69/0.51  % TRYING [2]
% 1.69/0.51  % TRYING [3]
% 1.69/0.51  % (1178206)Instruction limit reached! 
% 1.69/0.51  % (1178206)------------------------------
% 1.69/0.51  % (1178206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.51  % (1178206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.51  % (1178206)CaDiCaL version: 2.1.3
% 1.69/0.51  % (1178206)Termination reason: Instruction limit
% 1.69/0.51  % (1178206)Termination phase: Saturation
% 1.69/0.51  % (1178206)Time elapsed: 0.058 s
% 1.69/0.51  % (1178206)Peak memory usage: 12 MB
% 1.69/0.51  % (1178206)Instructions burned: 103 (million)
% 1.69/0.51  % TRYING [4]
% 1.69/0.51  % TRYING [4]
% 1.69/0.51  % (1178219)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2802653775:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.51  % (1178208)Instruction limit reached! 
% 1.69/0.51  % (1178208)------------------------------
% 1.69/0.51  % (1178208)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.51  % (1178208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.51  % (1178208)CaDiCaL version: 2.1.3
% 1.69/0.51  % (1178208)Termination reason: Instruction limit
% 1.69/0.51  % (1178208)Termination phase: Saturation
% 1.69/0.51  % (1178208)Time elapsed: 0.080 s
% 1.69/0.51  % (1178208)Peak memory usage: 13 MB
% 1.69/0.51  % (1178208)Instructions burned: 131 (million)
% 1.69/0.51  % (1178209)Instruction limit reached! 
% 1.69/0.51  % (1178209)------------------------------
% 1.69/0.51  % (1178209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.51  % (1178209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.51  % (1178209)CaDiCaL version: 2.1.3
% 1.69/0.51  % (1178209)Termination reason: Instruction limit
% 1.69/0.51  % (1178209)Termination phase: Saturation
% 1.69/0.51  % (1178209)Time elapsed: 0.099 s
% 1.69/0.51  % (1178209)Peak memory usage: 13 MB
% 1.69/0.51  % (1178209)Instructions burned: 159 (million)
% 1.69/0.51  % (1178221)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=893571487:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.69/0.51  % (1178222)ott-21_1_sil=16000:fs=off:random_seed=4045147806:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.69/0.51  % (1178219)Instruction limit reached! 
% 1.69/0.51  % (1178219)------------------------------
% 1.69/0.51  % (1178219)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.51  % (1178219)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.51  % (1178219)CaDiCaL version: 2.1.3
% 1.69/0.51  % (1178219)Termination reason: Instruction limit
% 1.69/0.51  % (1178219)Termination phase: Saturation
% 1.69/0.51  % (1178219)Time elapsed: 0.077 s
% 1.69/0.51  % (1178219)Peak memory usage: 13 MB
% 1.69/0.51  % (1178219)Instructions burned: 131 (million)
% 1.69/0.51  % (1178233)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=403555674:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.69/0.51  % (1178205) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1178198-1178205"...
% 1.69/0.51  % (1178205)...printing done.
% 1.69/0.51  % (1178205)Refutation found. Thanks to Tanya!
% 1.69/0.51  % SZS status Unsatisfiable for theBenchmark
% 1.69/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 1.69/0.51  % (1178205)------------------------------
% 1.69/0.51  % (1178205)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.51  % (1178205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.51  % (1178205)CaDiCaL version: 2.1.3
% 1.69/0.51  % (1178205)Termination reason: Refutation
% 1.69/0.51  % (1178205)Time elapsed: 0.220 s
% 1.69/0.51  % (1178205)Peak memory usage: 15 MB
% 1.69/0.51  % (1178205)Instructions burned: 422 (million)
% 1.69/0.51  % (1178198)Success in time 0.263 s
% 1.69/0.51  % Vampire exiting
%------------------------------------------------------------------------------