%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP547-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 10:18:04 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.46s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 41 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 15 ( 15 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 76 ( 76 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : divide(divide(identity,divide(X0,X1)),divide(divide(X1,X2),X0)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f4,axiom,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
fof(f6,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(definition_unfolding,[],[f5,f2,f2,f2,f2]) ).
fof(f7,plain,
! [X0,X1] : divide(X0,X0) = divide(X1,X1),
inference(superposition,[],[f4,f4]) ).
fof(f8,plain,
! [X0] : divide(divide(a3,divide(divide(X0,X0),b3)),divide(divide(X0,X0),c3)) != divide(a3,divide(divide(X0,X0),divide(b3,divide(divide(X0,X0),c3)))),
inference(superposition,[],[f6,f4]) ).
fof(f11,plain,
! [X0,X1] : divide(divide(identity,identity),divide(divide(X0,X1),X0)) = X1,
inference(superposition,[],[f1,f4]) ).
fof(f13,plain,
! [X0,X1] : divide(divide(identity,divide(X0,X1)),divide(identity,X0)) = X1,
inference(superposition,[],[f1,f4]) ).
fof(f14,plain,
! [X2,X3,X0,X1] : divide(divide(X3,X0),X2) = divide(divide(identity,divide(X1,divide(identity,divide(X2,X3)))),divide(X0,X1)),
inference(superposition,[],[f1,f1]) ).
fof(f15,plain,
! [X2,X0,X1] : divide(X2,X1) = divide(divide(identity,divide(divide(divide(X1,X0),X2),identity)),X0),
inference(superposition,[],[f1,f1]) ).
fof(f17,plain,
! [X0,X1] : divide(identity,divide(divide(X0,X1),X0)) = X1,
inference(forward_demodulation,[],[f11,f4]) ).
fof(f33,plain,
! [X2,X0,X1] : divide(divide(identity,divide(divide(X1,X2),X1)),divide(X0,X0)) = X2,
inference(superposition,[],[f1,f7]) ).
fof(f34,plain,
! [X2,X0] : divide(X2,divide(X0,X0)) = X2,
inference(forward_demodulation,[],[f33,f17]) ).
fof(f38,plain,
! [X0,X1] : divide(identity,divide(divide(X0,X0),X1)) = X1,
inference(superposition,[],[f17,f7]) ).
fof(f63,plain,
! [X2,X0,X1] : divide(divide(identity,divide(divide(X2,X2),X0)),divide(X0,X1)) = X1,
inference(superposition,[],[f1,f34]) ).
fof(f64,plain,
! [X0,X1] : divide(X0,divide(X0,X1)) = X1,
inference(forward_demodulation,[],[f63,f38]) ).
fof(f72,plain,
! [X0,X1] : divide(divide(X1,X0),X1) = divide(divide(identity,X0),divide(identity,identity)),
inference(superposition,[],[f13,f17]) ).
fof(f73,plain,
! [X0,X1] : divide(X0,divide(identity,divide(X1,X0))) = X1,
inference(superposition,[],[f13,f17]) ).
fof(f84,plain,
! [X0,X1] : divide(identity,X1) = divide(identity,divide(X0,divide(identity,divide(X1,X0)))),
inference(superposition,[],[f17,f13]) ).
fof(f92,plain,
! [X0,X1] : divide(identity,X0) = divide(divide(X1,X0),X1),
inference(forward_demodulation,[],[f72,f34]) ).
fof(f269,plain,
! [X2,X0,X1] : divide(X2,X0) = divide(divide(identity,divide(X1,X2)),divide(X0,X1)),
inference(superposition,[],[f1,f64]) ).
fof(f274,plain,
! [X0,X1] : divide(identity,divide(X0,X1)) = divide(X1,X0),
inference(superposition,[],[f17,f64]) ).
fof(f625,plain,
! [X2,X0,X1] : divide(identity,divide(divide(divide(X1,X2),X0),identity)) = divide(X2,divide(identity,divide(X0,X1))),
inference(superposition,[],[f73,f15]) ).
fof(f679,plain,
! [X2,X0,X1] : divide(identity,divide(divide(X1,X2),X0)) = divide(X2,divide(identity,divide(X0,X1))),
inference(forward_demodulation,[],[f625,f274]) ).
fof(f801,plain,
! [X0,X1] : divide(divide(a3,divide(divide(X1,X1),b3)),divide(divide(identity,divide(X0,divide(identity,divide(c3,X1)))),divide(X1,X0))) != divide(a3,divide(divide(X1,X1),divide(b3,divide(divide(identity,divide(X0,divide(identity,divide(c3,X1)))),divide(X1,X0))))),
inference(superposition,[],[f8,f14]) ).
fof(f860,plain,
! [X1] : divide(divide(a3,divide(divide(X1,X1),b3)),divide(divide(identity,divide(c3,X1)),X1)) != divide(a3,divide(divide(X1,X1),divide(b3,divide(divide(identity,divide(c3,X1)),X1)))),
inference(forward_demodulation,[],[f801,f269]) ).
fof(f962,plain,
! [X1] : divide(divide(a3,divide(divide(X1,X1),b3)),divide(identity,divide(X1,divide(identity,divide(c3,X1))))) != divide(a3,divide(divide(X1,X1),divide(b3,divide(identity,divide(X1,divide(identity,divide(c3,X1))))))),
inference(forward_demodulation,[],[f860,f274]) ).
fof(f1010,plain,
! [X1] : divide(divide(a3,divide(divide(X1,X1),b3)),divide(identity,c3)) != divide(a3,divide(divide(X1,X1),divide(b3,divide(identity,c3)))),
inference(forward_demodulation,[],[f962,f84]) ).
fof(f1037,plain,
! [X0,X1] : divide(a3,divide(divide(X1,X1),divide(b3,divide(identity,c3)))) != divide(divide(a3,divide(divide(identity,divide(X0,divide(identity,divide(b3,X1)))),divide(X1,X0))),divide(identity,c3)),
inference(superposition,[],[f1010,f14]) ).
fof(f1041,plain,
! [X1] : divide(a3,divide(divide(X1,X1),divide(b3,divide(identity,c3)))) != divide(divide(a3,divide(divide(identity,divide(b3,X1)),X1)),divide(identity,c3)),
inference(forward_demodulation,[],[f1037,f269]) ).
fof(f1043,plain,
! [X1] : divide(a3,divide(divide(X1,X1),divide(b3,divide(identity,c3)))) != divide(divide(a3,divide(identity,divide(X1,divide(identity,divide(b3,X1))))),divide(identity,c3)),
inference(forward_demodulation,[],[f1041,f274]) ).
fof(f1045,plain,
! [X1] : divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(X1,X1),divide(b3,divide(identity,c3)))),
inference(forward_demodulation,[],[f1043,f84]) ).
fof(f1149,plain,
! [X2,X0,X1] : divide(X1,divide(X2,X0)) = divide(divide(identity,divide(divide(divide(identity,X0),X1),identity)),X2),
inference(superposition,[],[f15,f92]) ).
fof(f1159,plain,
! [X2,X0,X1] : divide(X1,divide(X2,X0)) = divide(divide(X1,divide(identity,divide(identity,divide(identity,X0)))),X2),
inference(forward_demodulation,[],[f1149,f679]) ).
fof(f1204,plain,
! [X2,X0,X1] : divide(divide(X1,divide(identity,X0)),X2) = divide(X1,divide(X2,X0)),
inference(forward_demodulation,[],[f1159,f64]) ).
fof(f1334,plain,
! [X0,X1] : divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,divide(X0,divide(identity,divide(divide(b3,divide(identity,c3)),X1)))),divide(X1,X0))),
inference(superposition,[],[f1045,f14]) ).
fof(f1336,plain,
! [X1] : divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,divide(divide(b3,divide(identity,c3)),X1)),X1)),
inference(forward_demodulation,[],[f1334,f269]) ).
fof(f1337,plain,
! [X1] : divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(divide(a3,divide(identity,X1)),divide(identity,divide(divide(b3,divide(identity,c3)),X1))),
inference(forward_demodulation,[],[f1336,f1204]) ).
fof(f1480,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(divide(a3,divide(identity,b3)),divide(identity,c3)),
inference(superposition,[],[f1337,f17]) ).
fof(f1482,plain,
$false,
inference(trivial_inequality_removal,[],[f1480]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP547-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n005.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 10:06:47 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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.09/0.46 % (3767652)Will run a generic schedule for satisfiability detection.
% 0.09/0.46 % (3767662)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2695303673:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.09/0.46 % (3767658)% WARNING: option uhcvi not known.
% 0.09/0.46 % (3767657)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2943408134_3000 on theBenchmark for (3000ds/0Mi)
% 0.09/0.46 % (3767659)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2966209340:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.09/0.46 % (3767660)dis+10_1_sil=32000:sp=arity:random_seed=1289382658:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.09/0.46 % (3767661)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2573672443:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.09/0.46 % (3767658)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=272469691:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.09/0.46 % TRYING [1]
% 0.09/0.46 % TRYING [2]
% 0.09/0.46 % TRYING [3]
% 0.09/0.46 % (3767663)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=533042041:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.09/0.46 % TRYING [4]
% 0.09/0.46 % TRYING [5]
% 0.09/0.46 % (3767662) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3767652-3767662"...
% 0.09/0.46 % (3767662)...printing done.
% 0.09/0.46 % (3767662)Refutation found. Thanks to Tanya!
% 0.09/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.46 % (3767662)------------------------------
% 0.09/0.46 % (3767662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.46 % (3767662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.46 % (3767662)CaDiCaL version: 2.1.3
% 0.09/0.46 % (3767662)Termination reason: Refutation
% 0.09/0.46 % (3767662)Time elapsed: 0.025 s
% 0.09/0.46 % (3767662)Peak memory usage: 12 MB
% 0.09/0.46 % (3767662)Instructions burned: 70 (million)
% 0.09/0.46 % (3767652)Success in time 0.042 s
% 0.09/0.46 % Vampire exiting
%------------------------------------------------------------------------------