%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GRP592-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n017.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:10 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(X2))))),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
fof(f4,plain,
inverse(double_divide(b,a)) != inverse(double_divide(a,b)),
inference(definition_unfolding,[],[f3,f2,f2]) ).
fof(f5,plain,
! [X2,X3,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(X0))))),inverse(X3))))),X2) = X3,
inference(superposition,[],[f1,f1]) ).
fof(f11,plain,
! [X2,X0] : double_divide(inverse(double_divide(X0,inverse(X0))),inverse(X2)) = X2,
inference(superposition,[],[f5,f1]) ).
fof(f15,plain,
! [X0,X1] : double_divide(inverse(double_divide(X1,inverse(X0))),inverse(X1)) = X0,
inference(superposition,[],[f5,f11]) ).
fof(f25,plain,
! [X0,X1] : double_divide(inverse(X0),inverse(inverse(double_divide(X1,inverse(X1))))) = X0,
inference(superposition,[],[f15,f11]) ).
fof(f50,plain,
! [X0,X1] : inverse(double_divide(X0,inverse(X0))) = double_divide(X1,inverse(X1)),
inference(superposition,[],[f25,f11]) ).
fof(f65,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(X0),inverse(X2))))),inverse(inverse(double_divide(X1,inverse(X1))))) = X2,
inference(superposition,[],[f1,f25]) ).
fof(f66,plain,
! [X2,X0] : double_divide(X0,inverse(double_divide(inverse(X0),inverse(X2)))) = X2,
inference(forward_demodulation,[],[f65,f25]) ).
fof(f83,plain,
! [X0,X1] : double_divide(inverse(X1),inverse(double_divide(X0,inverse(X0)))) = X1,
inference(superposition,[],[f25,f50]) ).
fof(f200,plain,
! [X0,X1] : double_divide(double_divide(X1,inverse(X0)),inverse(X0)) = X1,
inference(superposition,[],[f66,f15]) ).
fof(f224,plain,
! [X0,X1] : double_divide(X0,inverse(X1)) = inverse(double_divide(X1,inverse(X0))),
inference(superposition,[],[f200,f15]) ).
fof(f276,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f83,f66]) ).
fof(f323,plain,
! [X0,X1] : double_divide(double_divide(X1,X0),X0) = X1,
inference(superposition,[],[f200,f276]) ).
fof(f921,plain,
! [X0,X1] : double_divide(X1,double_divide(X0,inverse(inverse(X1)))) = X0,
inference(superposition,[],[f66,f224]) ).
fof(f970,plain,
! [X0,X1] : double_divide(X1,double_divide(X0,X1)) = X0,
inference(forward_demodulation,[],[f921,f276]) ).
fof(f1026,plain,
! [X0,X1] : double_divide(X0,X1) = double_divide(X1,X0),
inference(superposition,[],[f970,f323]) ).
fof(f1240,plain,
inverse(double_divide(a,b)) != inverse(double_divide(a,b)),
inference(superposition,[],[f4,f1026]) ).
fof(f1241,plain,
$false,
inference(trivial_inequality_removal,[],[f1240]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP592-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % 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:19 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.42 Running first-order model finding
% 0.11/0.42 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.50 % (2312910)Will run a generic schedule for satisfiability detection.
% 0.17/0.50 % (2312923)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1533988141_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.50 % TRYING [1]
% 0.17/0.50 % TRYING [2]
% 0.17/0.50 % TRYING [3]
% 0.17/0.50 % (2312924)% WARNING: option uhcvi not known.
% 0.17/0.50 % (2312924)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3993039747:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.50 % (2312925)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3239894173:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.50 % (2312928)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=317395160:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.50 % (2312926)dis+10_1_sil=32000:sp=arity:random_seed=264559899:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.50 % (2312927)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2079350372:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.50 % (2312930)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4027317411:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.50 % TRYING [4]
% 0.17/0.50 % (2312925) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2312910-2312925"...
% 0.17/0.50 % (2312925)...printing done.
% 0.17/0.50 % (2312925)Refutation found. Thanks to Tanya!
% 0.17/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.50 % (2312925)------------------------------
% 0.17/0.50 % (2312925)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.50 % (2312925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.50 % (2312925)CaDiCaL version: 2.1.3
% 0.17/0.50 % (2312925)Termination reason: Refutation
% 0.17/0.50 % (2312925)Time elapsed: 0.029 s
% 0.17/0.50 % (2312925)Peak memory usage: 12 MB
% 0.17/0.50 % (2312925)Instructions burned: 49 (million)
% 0.17/0.50 % (2312910)Success in time 0.077 s
% 0.17/0.50 % Vampire exiting
%------------------------------------------------------------------------------