TSTP Solution File: GRP089-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP089-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 05:53:21 EDT 2024
% Result : Unsatisfiable 2.29s 0.70s
% Output : Refutation 2.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of formulae : 44 ( 39 unt; 0 def)
% Number of atoms : 54 ( 53 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 18 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 81 ( 81 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22802,plain,
$false,
inference(trivial_inequality_removal,[],[f22801]) ).
fof(f22801,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
inference(forward_demodulation,[],[f22631,f766]) ).
fof(f766,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f419,f730]) ).
fof(f730,plain,
! [X0,X1] : divide(multiply(X0,X1),X0) = X1,
inference(forward_demodulation,[],[f709,f673]) ).
fof(f673,plain,
! [X0,X1] : multiply(X0,X1) = inverse(divide(inverse(X0),X1)),
inference(superposition,[],[f160,f123]) ).
fof(f123,plain,
! [X0,X1] : multiply(inverse(divide(X1,X0)),X1) = X0,
inference(superposition,[],[f100,f63]) ).
fof(f63,plain,
! [X0,X1] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[],[f1,f3]) ).
fof(f3,axiom,
! [X2,X0] : inverse(X0) = divide(divide(X2,X2),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
fof(f1,axiom,
! [X2,X0,X1] : divide(X0,divide(divide(X0,X1),divide(X2,X1))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f100,plain,
! [X0,X1] : multiply(X0,divide(X1,X0)) = X1,
inference(superposition,[],[f63,f5]) ).
fof(f5,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[],[f2,f3]) ).
fof(f2,axiom,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f160,plain,
! [X0,X1] : multiply(X0,multiply(X1,inverse(X0))) = X1,
inference(superposition,[],[f122,f153]) ).
fof(f153,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f123,f13]) ).
fof(f13,plain,
! [X0,X1] : inverse(inverse(X1)) = multiply(inverse(divide(X0,X0)),X1),
inference(superposition,[],[f6,f5]) ).
fof(f6,plain,
! [X0,X1] : inverse(X1) = divide(inverse(divide(X0,X0)),X1),
inference(superposition,[],[f3,f3]) ).
fof(f122,plain,
! [X0,X1] : multiply(inverse(X1),multiply(X0,X1)) = X0,
inference(superposition,[],[f100,f5]) ).
fof(f709,plain,
! [X0,X1] : divide(inverse(divide(inverse(X0),X1)),X0) = X1,
inference(superposition,[],[f164,f123]) ).
fof(f164,plain,
! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
inference(superposition,[],[f5,f153]) ).
fof(f419,plain,
! [X0,X1] : multiply(divide(X0,X1),X1) = X0,
inference(superposition,[],[f100,f372]) ).
fof(f372,plain,
! [X2,X0] : divide(X2,divide(X2,X0)) = X0,
inference(forward_demodulation,[],[f355,f214]) ).
fof(f214,plain,
! [X2,X0] : divide(X0,divide(X2,X2)) = X0,
inference(forward_demodulation,[],[f189,f164]) ).
fof(f189,plain,
! [X2,X0] : divide(X0,multiply(X2,inverse(X2))) = X0,
inference(superposition,[],[f1,f125]) ).
fof(f125,plain,
! [X0,X1] : divide(X0,X0) = multiply(X1,inverse(X1)),
inference(superposition,[],[f100,f3]) ).
fof(f355,plain,
! [X2,X0,X1] : divide(X2,divide(divide(X2,divide(X1,X1)),X0)) = X0,
inference(superposition,[],[f1,f214]) ).
fof(f22631,plain,
multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3)),
inference(superposition,[],[f5263,f12229]) ).
fof(f12229,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = multiply(multiply(X2,X1),X0),
inference(forward_demodulation,[],[f12228,f5]) ).
fof(f12228,plain,
! [X2,X0,X1] : divide(X2,inverse(multiply(X0,X1))) = multiply(multiply(X2,X1),X0),
inference(forward_demodulation,[],[f12227,f5]) ).
fof(f12227,plain,
! [X2,X0,X1] : divide(X2,inverse(multiply(X0,X1))) = divide(multiply(X2,X1),inverse(X0)),
inference(forward_demodulation,[],[f12120,f5]) ).
fof(f12120,plain,
! [X2,X0,X1] : divide(X2,inverse(multiply(X0,X1))) = divide(divide(X2,inverse(X1)),inverse(X0)),
inference(superposition,[],[f64,f1932]) ).
fof(f1932,plain,
! [X0,X1] : inverse(X0) = divide(inverse(multiply(X1,X0)),inverse(X1)),
inference(superposition,[],[f92,f122]) ).
fof(f92,plain,
! [X0,X1] : divide(inverse(X1),inverse(multiply(X0,X1))) = X0,
inference(superposition,[],[f63,f5]) ).
fof(f64,plain,
! [X2,X0,X1] : divide(X0,X1) = divide(divide(X0,divide(X1,X2)),X2),
inference(superposition,[],[f1,f1]) ).
fof(f5263,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(subsumption_resolution,[],[f5262,f209]) ).
fof(f209,plain,
! [X0,X1] : multiply(inverse(divide(X1,X1)),X0) = X0,
inference(forward_demodulation,[],[f183,f164]) ).
fof(f183,plain,
! [X0,X1] : multiply(inverse(multiply(X1,inverse(X1))),X0) = X0,
inference(superposition,[],[f123,f125]) ).
fof(f5262,plain,
! [X0] :
( a2 != multiply(inverse(divide(X0,X0)),a2)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(forward_demodulation,[],[f5261,f146]) ).
fof(f146,plain,
! [X0,X1] : inverse(divide(X1,X0)) = multiply(inverse(X1),X0),
inference(superposition,[],[f123,f63]) ).
fof(f5261,plain,
! [X0] :
( a2 != multiply(multiply(inverse(X0),X0),a2)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(subsumption_resolution,[],[f5260,f455]) ).
fof(f455,plain,
! [X0,X1] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[],[f419,f8]) ).
fof(f8,plain,
! [X0,X1] : inverse(X1) = divide(multiply(inverse(X0),X0),X1),
inference(superposition,[],[f3,f5]) ).
fof(f5260,plain,
! [X0] :
( a2 != multiply(multiply(inverse(X0),X0),a2)
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(subsumption_resolution,[],[f5248,f766]) ).
fof(f5248,plain,
! [X0] :
( a2 != multiply(multiply(inverse(X0),X0),a2)
| multiply(a4,b4) != multiply(b4,a4)
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(superposition,[],[f4,f455]) ).
fof(f4,axiom,
( a2 != multiply(multiply(inverse(b2),b2),a2)
| multiply(a4,b4) != multiply(b4,a4)
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP089-1 : TPTP v8.1.2. Bugfixed v2.7.0.
% 0.15/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:44:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (23952)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38 % (23955)WARNING: value z3 for option sas not known
% 0.22/0.38 % (23953)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.38 % (23954)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.38 % (23956)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.38 % (23957)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.22/0.38 % (23959)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.38 % (23955)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38 % (23958)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [1]
% 0.22/0.38 TRYING [2]
% 0.22/0.38 TRYING [3]
% 0.22/0.39 TRYING [3]
% 0.22/0.39 TRYING [4]
% 0.22/0.48 TRYING [4]
% 0.22/0.48 TRYING [5]
% 2.29/0.69 % (23959)First to succeed.
% 2.29/0.69 % (23959)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23952"
% 2.29/0.70 % (23959)Refutation found. Thanks to Tanya!
% 2.29/0.70 % SZS status Unsatisfiable for theBenchmark
% 2.29/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 2.29/0.70 % (23959)------------------------------
% 2.29/0.70 % (23959)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.29/0.70 % (23959)Termination reason: Refutation
% 2.29/0.70
% 2.29/0.70 % (23959)Memory used [KB]: 5416
% 2.29/0.70 % (23959)Time elapsed: 0.319 s
% 2.29/0.70 % (23959)Instructions burned: 941 (million)
% 2.29/0.70 % (23952)Success in time 0.331 s
%------------------------------------------------------------------------------