↑ 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  : GRP089-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n015.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:16:37 AM UTC 2026

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   64 (  38 unt;   4 def)
%            Number of atoms       :   98 (  54 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   64 (  30   ~;  30   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :   65 (   0 sgn  65   !;   0   ?)

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

fof(f2,axiom,
    ! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

fof(f3,axiom,
    ! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).

fof(f4,negated_conjecture,
    ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(a4,b4) != multiply(b4,a4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).

fof(f5,plain,
    ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | a2 != multiply(multiply(inverse(b2),b2),a2)
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(a4,b4) != multiply(b4,a4) ),
    inference(reorient_equations,[],[f4]) ).

fof(f7,definition,
    ( spl0_1
  <=> multiply(a4,b4) = multiply(b4,a4) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f9,plain,
    ( multiply(a4,b4) != multiply(b4,a4)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f7]) ).

fof(f11,definition,
    ( spl0_2
  <=> multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f13,plain,
    ( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f11]) ).

fof(f15,definition,
    ( spl0_3
  <=> a2 = multiply(multiply(inverse(b2),b2),a2) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f17,plain,
    ( a2 != multiply(multiply(inverse(b2),b2),a2)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f15]) ).

fof(f19,definition,
    ( spl0_4
  <=> multiply(inverse(a1),a1) = multiply(inverse(b1),b1) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f21,plain,
    ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f22,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f5,f19,f15,f11,f7]) ).

fof(f40,plain,
    ! [X2,X0,X1] : divide(X1,X0) = divide(divide(X1,divide(X0,X2)),X2),
    inference(superposition,[],[f1,f1]) ).

fof(f41,plain,
    ! [X0,X1] : divide(X1,inverse(divide(X0,X1))) = X0,
    inference(superposition,[],[f1,f3]) ).

fof(f45,plain,
    ! [X2,X0,X1] : inverse(divide(divide(divide(X1,X1),X2),divide(X0,X2))) = X0,
    inference(superposition,[],[f3,f1]) ).

fof(f50,plain,
    ! [X2,X0] : inverse(divide(inverse(X2),divide(X0,X2))) = X0,
    inference(forward_demodulation,[],[f45,f3]) ).

fof(f79,plain,
    ! [X0,X1] : inverse(X1) = divide(divide(X0,X1),X0),
    inference(superposition,[],[f41,f50]) ).

fof(f80,plain,
    ! [X0,X1] : inverse(X1) = divide(inverse(X0),divide(X1,X0)),
    inference(superposition,[],[f79,f79]) ).

fof(f86,plain,
    ! [X0,X1] : divide(divide(X1,X0),inverse(X0)) = X1,
    inference(superposition,[],[f1,f79]) ).

fof(f91,plain,
    ! [X0,X1] : divide(X1,X0) = divide(inverse(X0),inverse(X1)),
    inference(superposition,[],[f86,f79]) ).

fof(f99,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f86,f3]) ).

fof(f108,plain,
    ! [X0,X1] : divide(divide(X1,inverse(X0)),X0) = X1,
    inference(superposition,[],[f86,f99]) ).

fof(f114,plain,
    ! [X0,X1] : divide(X1,X1) = divide(inverse(inverse(X0)),X0),
    inference(superposition,[],[f108,f3]) ).

fof(f127,plain,
    ! [X0,X1] : divide(X1,X1) = divide(X0,X0),
    inference(forward_demodulation,[],[f114,f99]) ).

fof(f474,plain,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
    inference(forward_demodulation,[],[f2,f3]) ).

fof(f475,plain,
    ! [X2,X0,X1] : divide(X1,X0) = multiply(X1,divide(inverse(X2),divide(X0,X2))),
    inference(superposition,[],[f474,f50]) ).

fof(f479,plain,
    ! [X0,X1] : multiply(X1,divide(X0,X1)) = X0,
    inference(superposition,[],[f474,f41]) ).

fof(f502,plain,
    ! [X0,X1] : divide(inverse(X1),inverse(multiply(X0,X1))) = X0,
    inference(superposition,[],[f41,f474]) ).

fof(f524,plain,
    ! [X0,X1] : divide(multiply(X0,X1),X1) = X0,
    inference(forward_demodulation,[],[f502,f91]) ).

fof(f535,plain,
    ! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
    inference(forward_demodulation,[],[f475,f80]) ).

fof(f583,plain,
    ! [X0,X1] : multiply(X0,X1) = divide(X1,inverse(X0)),
    inference(superposition,[],[f41,f524]) ).

fof(f590,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[],[f479,f524]) ).

fof(f637,plain,
    ( multiply(a4,b4) != multiply(a4,b4)
    | spl0_1 ),
    inference(superposition,[],[f9,f590]) ).

fof(f649,plain,
    ( $false
    | spl0_1 ),
    inference(trivial_inequality_removal,[],[f637]) ).

fof(f650,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f649]) ).

fof(f651,plain,
    ( multiply(a3,multiply(b3,c3)) != multiply(c3,multiply(a3,b3))
    | spl0_2 ),
    inference(forward_demodulation,[],[f13,f590]) ).

fof(f1265,plain,
    ! [X2,X0,X1] : divide(X1,X2) = divide(divide(X1,X0),inverse(divide(X0,X2))),
    inference(superposition,[],[f40,f41]) ).

fof(f1332,plain,
    ! [X2,X0,X1] : divide(X1,X2) = multiply(divide(X1,X0),divide(X0,X2)),
    inference(forward_demodulation,[],[f1265,f474]) ).

fof(f1665,plain,
    ! [X2,X0,X1] : divide(multiply(X0,X1),X2) = multiply(X0,divide(X1,X2)),
    inference(superposition,[],[f1332,f524]) ).

fof(f3112,plain,
    ! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(X0,divide(X1,inverse(X2))),
    inference(superposition,[],[f583,f1665]) ).

fof(f3117,plain,
    ! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(X0,multiply(X1,X2)),
    inference(forward_demodulation,[],[f3112,f474]) ).

fof(f7673,plain,
    ( multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(c3,a3))
    | spl0_2 ),
    inference(superposition,[],[f651,f3117]) ).

fof(f7676,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f7673,f3117]) ).

fof(f7677,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f7676]) ).

fof(f8001,plain,
    ( a2 != multiply(a2,multiply(inverse(b2),b2))
    | spl0_3 ),
    inference(forward_demodulation,[],[f17,f590]) ).

fof(f8002,plain,
    ( a2 != multiply(b2,multiply(a2,inverse(b2)))
    | spl0_3 ),
    inference(forward_demodulation,[],[f8001,f3117]) ).

fof(f8003,plain,
    ( a2 != multiply(b2,divide(a2,b2))
    | spl0_3 ),
    inference(forward_demodulation,[],[f8002,f535]) ).

fof(f8004,plain,
    ( $false
    | spl0_3 ),
    inference(forward_subsumption_resolution,[],[f8003,f479]) ).

fof(f8005,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f8004]) ).

fof(f8007,plain,
    ( multiply(inverse(a1),a1) != multiply(b1,inverse(b1))
    | spl0_4 ),
    inference(forward_demodulation,[],[f21,f590]) ).

fof(f8009,plain,
    ( multiply(inverse(a1),a1) != divide(b1,b1)
    | spl0_4 ),
    inference(forward_demodulation,[],[f8007,f535]) ).

fof(f8011,plain,
    ( divide(b1,b1) != multiply(a1,inverse(a1))
    | spl0_4 ),
    inference(forward_demodulation,[],[f8009,f590]) ).

fof(f8012,plain,
    ( divide(b1,b1) != divide(a1,a1)
    | spl0_4 ),
    inference(forward_demodulation,[],[f8011,f535]) ).

fof(f8013,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f8012,f127]) ).

fof(f8014,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f8013]) ).

cnf(s6,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f22]) ).

cnf(s283,plain,
    spl0_1,
    inference(sat_conversion,[],[f650]) ).

cnf(s1515,plain,
    spl0_2,
    inference(sat_conversion,[],[f7677]) ).

cnf(s1587,plain,
    spl0_3,
    inference(sat_conversion,[],[f8005]) ).

cnf(s1588,plain,
    spl0_4,
    inference(sat_conversion,[],[f8014]) ).

cnf(s1589,plain,
    $false,
    inference(rat,[],[s6,s1588,s1587,s1515,s283]) ).

fof(f8015,plain,
    $false,
    inference(avatar_sat_refutation,[],[s1589]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP089-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n015.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 09:21:45 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41  Running first-order model finding
% 0.14/0.41  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.21/0.51  % (1388745)Will run a generic schedule for satisfiability detection.
% 0.21/0.51  % (1388752)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2994176022:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.51  % (1388751)% WARNING: option uhcvi not known.
% 0.21/0.51  % (1388750)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=890050487_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.51  % (1388754)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1226722015:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.51  % (1388751)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1854224927:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.51  % (1388753)dis+10_1_sil=32000:sp=arity:random_seed=1741690679:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.51  % (1388756)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2180431414:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.51  % (1388755)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2190679817:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.51  % TRYING [1]
% 0.21/0.51  % TRYING [2]
% 0.21/0.51  % TRYING [3]
% 0.21/0.51  % TRYING [4]
% 0.21/0.51  % (1388753)Instruction limit reached! 
% 0.21/0.51  % (1388753)------------------------------
% 0.21/0.51  % (1388753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.51  % (1388753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.51  % (1388753)CaDiCaL version: 2.1.3
% 0.21/0.51  % (1388753)Termination reason: Instruction limit
% 0.21/0.51  % (1388753)Termination phase: Saturation
% 0.21/0.51  % (1388753)Time elapsed: 0.058 s
% 0.21/0.51  % (1388753)Peak memory usage: 12 MB
% 0.21/0.51  % (1388753)Instructions burned: 105 (million)
% 0.21/0.51  % (1388752) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1388745-1388752"...
% 0.21/0.51  % (1388752)...printing done.
% 0.21/0.51  % (1388752)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (1388752)------------------------------
% 0.21/0.51  % (1388752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.51  % (1388752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.51  % (1388752)CaDiCaL version: 2.1.3
% 0.21/0.51  % (1388752)Termination reason: Refutation
% 0.21/0.51  % (1388752)Time elapsed: 0.068 s
% 0.21/0.51  % (1388752)Peak memory usage: 14 MB
% 0.21/0.51  % (1388752)Instructions burned: 229 (million)
% 0.21/0.51  % (1388745)Success in time 0.094 s
% 0.21/0.51  % Vampire exiting
%------------------------------------------------------------------------------