↑ 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  : GRP403-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 : n019.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 10:17:43 AM UTC 2026

% Result   : Unsatisfiable 0.17s 0.53s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (  15 unt;   0 def)
%            Number of atoms       :   15 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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   :   45 (  45   !;   0   ?)

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

fof(f2,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).

fof(f4,plain,
    ! [X2,X3,X0,X1] : inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),X0)),inverse(multiply(X3,multiply(inverse(X3),X3))))) = multiply(X1,inverse(multiply(inverse(X0),inverse(multiply(X2,multiply(inverse(X2),X2)))))),
    inference(superposition,[],[f1,f1]) ).

fof(f20,plain,
    ! [X2,X3,X0,X1] : inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(multiply(X1,X2)),X0))),inverse(multiply(X3,multiply(inverse(X3),X3))))) = X0,
    inference(superposition,[],[f4,f1]) ).

fof(f22,plain,
    ! [X2,X0,X1] : multiply(inverse(multiply(X0,X2)),multiply(X0,inverse(multiply(inverse(X1),inverse(multiply(X2,multiply(inverse(X2),X2))))))) = X1,
    inference(superposition,[],[f1,f4]) ).

fof(f52,plain,
    ! [X0,X4,X5] : inverse(multiply(inverse(multiply(inverse(multiply(X0,X4)),multiply(X0,X5))),inverse(multiply(X4,multiply(inverse(X4),X4))))) = X5,
    inference(superposition,[],[f20,f20]) ).

fof(f92,plain,
    ! [X2,X0,X1] : inverse(multiply(X2,multiply(inverse(X2),X2))) = multiply(inverse(multiply(X1,X2)),inverse(multiply(X0,inverse(multiply(multiply(X1,X0),multiply(inverse(multiply(X1,X0)),multiply(X1,X0))))))),
    inference(superposition,[],[f1,f52]) ).

fof(f94,plain,
    ! [X2,X3,X0,X1] : multiply(inverse(multiply(X1,X2)),multiply(X1,X0)) = multiply(inverse(multiply(X3,X2)),multiply(X3,X0)),
    inference(superposition,[],[f22,f52]) ).

fof(f114,plain,
    ! [X2,X3,X0,X1,X4] : multiply(X0,multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X0))),X3)) = multiply(inverse(multiply(X4,inverse(multiply(X2,multiply(inverse(X2),X2))))),multiply(X4,X3)),
    inference(superposition,[],[f94,f52]) ).

fof(f722,plain,
    ! [X2,X3,X0,X1,X4,X5] : multiply(X1,multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X1))),X4)) = multiply(X0,multiply(inverse(multiply(inverse(multiply(X5,X3)),multiply(X5,X0))),X4)),
    inference(superposition,[],[f114,f52]) ).

fof(f1552,plain,
    ! [X2,X0,X1] : multiply(inverse(multiply(inverse(multiply(X1,X0)),multiply(X1,inverse(X2)))),inverse(multiply(X0,multiply(inverse(X0),X0)))) = X2,
    inference(superposition,[],[f22,f92]) ).

fof(f1658,plain,
    ! [X2,X3,X0,X1] : multiply(inverse(X0),X0) = multiply(X1,multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X1))),inverse(multiply(X3,multiply(inverse(X3),X3))))),
    inference(superposition,[],[f722,f1552]) ).

fof(f1796,plain,
    ! [X0,X1] : multiply(inverse(X1),X1) = multiply(inverse(X0),X0),
    inference(superposition,[],[f1658,f1552]) ).

fof(f2176,plain,
    ! [X0] : multiply(inverse(a1),a1) != multiply(inverse(X0),X0),
    inference(superposition,[],[f2,f1796]) ).

fof(f2234,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f2176,f1796]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP403-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n019.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.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 10:03:40 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  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.17/0.53  % (2851377)Will run a generic schedule for satisfiability detection.
% 0.17/0.53  % (2851392)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1402228657:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.53  % (2851391)% WARNING: option uhcvi not known.
% 0.17/0.53  % (2851390)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1093025488_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.53  % (2851391)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1658520883:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.53  % (2851395)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4273987375:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.53  % (2851393)dis+10_1_sil=32000:sp=arity:random_seed=1158346123:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.53  % (2851394)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4172065155:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.53  % (2851396)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2317411954:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.53  % TRYING [1]
% 0.17/0.53  % TRYING [2]
% 0.17/0.53  % TRYING [3]
% 0.17/0.53  % (2851393)Instruction limit reached! 
% 0.17/0.53  % (2851393)------------------------------
% 0.17/0.53  % (2851393)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53  % (2851393)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53  % (2851393)CaDiCaL version: 2.1.3
% 0.17/0.53  % (2851393)Termination reason: Instruction limit
% 0.17/0.53  % (2851393)Termination phase: Saturation
% 0.17/0.53  % (2851393)Time elapsed: 0.055 s
% 0.17/0.53  % (2851393)Peak memory usage: 12 MB
% 0.17/0.53  % (2851393)Instructions burned: 104 (million)
% 0.17/0.53  % TRYING [4]
% 0.17/0.53  % (2851394)Instruction limit reached! 
% 0.17/0.53  % (2851394)------------------------------
% 0.17/0.53  % (2851394)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53  % (2851394)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53  % (2851394)CaDiCaL version: 2.1.3
% 0.17/0.53  % (2851394)Termination reason: Instruction limit
% 0.17/0.53  % (2851394)Termination phase: Saturation
% 0.17/0.53  % (2851394)Time elapsed: 0.068 s
% 0.17/0.53  % (2851394)Peak memory usage: 12 MB
% 0.17/0.53  % (2851394)Instructions burned: 117 (million)
% 0.17/0.53  % (2851392) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2851377-2851392"...
% 0.17/0.53  % (2851392)...printing done.
% 0.17/0.53  % (2851395)Instruction limit reached! 
% 0.17/0.53  % (2851395)------------------------------
% 0.17/0.53  % (2851395)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53  % (2851395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53  % (2851395)CaDiCaL version: 2.1.3
% 0.17/0.53  % (2851395)Termination reason: Instruction limit
% 0.17/0.53  % (2851395)Termination phase: Saturation
% 0.17/0.53  % (2851395)Time elapsed: 0.075 s
% 0.17/0.53  % (2851395)Peak memory usage: 13 MB
% 0.17/0.53  % (2851395)Instructions burned: 131 (million)
% 0.17/0.53  % (2851435)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=606233590:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.53  % TRYING [1]
% 0.17/0.53  % TRYING [2]
% 0.17/0.53  % TRYING [3]
% 0.17/0.53  % (2851392)Refutation found. Thanks to Tanya!
% 0.17/0.53  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.53  % (2851392)------------------------------
% 0.17/0.53  % (2851392)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53  % (2851392)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53  % (2851392)CaDiCaL version: 2.1.3
% 0.17/0.53  % (2851392)Termination reason: Refutation
% 0.17/0.53  % (2851392)Time elapsed: 0.082 s
% 0.17/0.53  % (2851392)Peak memory usage: 14 MB
% 0.17/0.53  % (2851392)Instructions burned: 286 (million)
% 0.17/0.53  % (2851377)Success in time 0.114 s
% 0.17/0.53  % Vampire exiting
%------------------------------------------------------------------------------