TSTP Solution File: GRP613-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP613-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n018.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 : Tue Apr 30 12:07:44 EDT 2024
% Result : Unsatisfiable 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of formulae : 44 ( 44 unt; 0 def)
% Number of atoms : 44 ( 43 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 : 8 ( 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 : 98 ( 98 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2120,plain,
$false,
inference(subsumption_resolution,[],[f2119,f1325]) ).
fof(f1325,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = multiply(inverse(X1),X1),
inference(superposition,[],[f936,f995]) ).
fof(f995,plain,
! [X0,X1] : multiply(double_divide(X0,inverse(X0)),X1) = X1,
inference(superposition,[],[f478,f422]) ).
fof(f422,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f415,f352]) ).
fof(f352,plain,
! [X0,X1] : double_divide(multiply(X1,inverse(X1)),inverse(X0)) = X0,
inference(superposition,[],[f193,f153]) ).
fof(f153,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(X2),multiply(X1,X0)),double_divide(X0,X1)) = X2,
inference(superposition,[],[f151,f2]) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f151,plain,
! [X3,X0] : double_divide(multiply(inverse(X0),inverse(X3)),X3) = X0,
inference(forward_demodulation,[],[f136,f5]) ).
fof(f5,plain,
! [X2,X0,X1] : double_divide(multiply(X2,multiply(inverse(X1),X0)),double_divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f4,f2]) ).
fof(f4,plain,
! [X2,X0,X1] : double_divide(multiply(X2,inverse(double_divide(X0,inverse(X1)))),double_divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f1,f2]) ).
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f136,plain,
! [X2,X3,X0,X1] : double_divide(multiply(double_divide(multiply(X2,multiply(inverse(inverse(X0)),X1)),double_divide(X1,X2)),inverse(X3)),X3) = X0,
inference(superposition,[],[f7,f9]) ).
fof(f9,plain,
! [X2,X3,X0,X1] : inverse(X3) = multiply(X1,multiply(double_divide(X2,X0),multiply(inverse(X3),multiply(X0,multiply(inverse(X1),X2))))),
inference(superposition,[],[f8,f5]) ).
fof(f8,plain,
! [X2,X0,X1] : inverse(X1) = multiply(double_divide(X2,X0),multiply(X0,multiply(inverse(X1),X2))),
inference(superposition,[],[f2,f5]) ).
fof(f7,plain,
! [X2,X3,X0,X1] : double_divide(multiply(double_divide(X2,X0),multiply(inverse(X3),multiply(X0,multiply(inverse(X1),X2)))),X1) = X3,
inference(superposition,[],[f5,f5]) ).
fof(f193,plain,
! [X2,X0,X1] : double_divide(X0,X1) = double_divide(multiply(X1,X0),double_divide(inverse(X2),X2)),
inference(superposition,[],[f172,f2]) ).
fof(f172,plain,
! [X0,X1] : double_divide(inverse(X1),double_divide(inverse(X0),X0)) = X1,
inference(superposition,[],[f5,f148]) ).
fof(f148,plain,
! [X3,X0] : inverse(X0) = multiply(X3,multiply(inverse(X0),inverse(X3))),
inference(forward_demodulation,[],[f129,f5]) ).
fof(f129,plain,
! [X2,X3,X0,X1] : inverse(X0) = multiply(X3,multiply(double_divide(multiply(X2,multiply(inverse(inverse(X0)),X1)),double_divide(X1,X2)),inverse(X3))),
inference(superposition,[],[f9,f9]) ).
fof(f415,plain,
! [X2,X1] : double_divide(multiply(inverse(X1),inverse(X2)),X1) = X2,
inference(forward_demodulation,[],[f407,f406]) ).
fof(f406,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(X1),multiply(X0,inverse(X0))),
inference(superposition,[],[f2,f352]) ).
fof(f407,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(X1),multiply(inverse(X2),multiply(X0,inverse(X0)))),X1) = X2,
inference(superposition,[],[f5,f352]) ).
fof(f478,plain,
! [X0,X1] : multiply(double_divide(inverse(X1),X1),X0) = X0,
inference(superposition,[],[f171,f422]) ).
fof(f171,plain,
! [X0,X1] : inverse(X1) = multiply(double_divide(inverse(X0),X0),inverse(X1)),
inference(superposition,[],[f8,f148]) ).
fof(f936,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X1,X0)) = X1,
inference(superposition,[],[f471,f422]) ).
fof(f471,plain,
! [X0,X1] : multiply(X1,multiply(X0,inverse(X1))) = X0,
inference(superposition,[],[f148,f422]) ).
fof(f2119,plain,
multiply(inverse(a1),a1) != double_divide(b1,inverse(b1)),
inference(forward_demodulation,[],[f2011,f971]) ).
fof(f971,plain,
! [X2,X0] : double_divide(X2,inverse(X0)) = multiply(X0,inverse(X2)),
inference(forward_demodulation,[],[f938,f551]) ).
fof(f551,plain,
! [X2,X0,X1] : double_divide(X2,inverse(X0)) = double_divide(multiply(inverse(X0),X1),double_divide(X1,inverse(X2))),
inference(superposition,[],[f504,f12]) ).
fof(f12,plain,
! [X2,X0,X1] : double_divide(inverse(X2),double_divide(multiply(inverse(X2),X0),double_divide(X0,inverse(X1)))) = X1,
inference(superposition,[],[f5,f8]) ).
fof(f504,plain,
! [X0,X1] : double_divide(double_divide(X1,X0),X1) = X0,
inference(superposition,[],[f489,f489]) ).
fof(f489,plain,
! [X0,X1] : double_divide(X0,double_divide(X1,X0)) = X1,
inference(forward_demodulation,[],[f483,f422]) ).
fof(f483,plain,
! [X0,X1] : double_divide(X0,double_divide(inverse(inverse(X1)),X0)) = X1,
inference(superposition,[],[f255,f422]) ).
fof(f255,plain,
! [X0,X1] : double_divide(inverse(X1),double_divide(inverse(inverse(X0)),inverse(X1))) = X0,
inference(superposition,[],[f153,f148]) ).
fof(f938,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(X0),X1),double_divide(X1,inverse(X2))) = multiply(X0,inverse(X2)),
inference(superposition,[],[f471,f11]) ).
fof(f11,plain,
! [X2,X0,X1] : inverse(X1) = multiply(double_divide(multiply(inverse(X2),X0),double_divide(X0,inverse(X1))),inverse(X2)),
inference(superposition,[],[f8,f8]) ).
fof(f2011,plain,
multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
inference(superposition,[],[f3,f1886]) ).
fof(f1886,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f743,f2]) ).
fof(f743,plain,
! [X0,X1] : inverse(double_divide(X1,X0)) = multiply(X1,X0),
inference(superposition,[],[f2,f609]) ).
fof(f609,plain,
! [X0,X1] : double_divide(X1,X0) = double_divide(X0,X1),
inference(superposition,[],[f570,f489]) ).
fof(f570,plain,
! [X0,X1] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(forward_demodulation,[],[f542,f490]) ).
fof(f490,plain,
! [X0,X1] : double_divide(X0,X1) = multiply(inverse(X0),inverse(X1)),
inference(superposition,[],[f489,f415]) ).
fof(f542,plain,
! [X0,X1] : double_divide(X0,multiply(inverse(X0),inverse(X1))) = X1,
inference(superposition,[],[f504,f151]) ).
fof(f3,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP613-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 04:36:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (25025)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (25026)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.37 TRYING [1]
% 0.20/0.37 % (25031)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.20/0.37 TRYING [2]
% 0.20/0.38 TRYING [3]
% 0.20/0.38 % (25028)WARNING: value z3 for option sas not known
% 0.20/0.38 % (25027)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.38 % (25029)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.38 % (25028)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.20/0.38 % (25030)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.20/0.38 % (25032)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.20/0.38 TRYING [1]
% 0.20/0.39 TRYING [2]
% 0.20/0.39 TRYING [3]
% 0.20/0.40 TRYING [4]
% 0.20/0.40 TRYING [4]
% 0.20/0.44 TRYING [5]
% 0.20/0.45 % (25032)First to succeed.
% 0.20/0.45 % (25032)Refutation found. Thanks to Tanya!
% 0.20/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.45 % (25032)------------------------------
% 0.20/0.45 % (25032)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.45 % (25032)Termination reason: Refutation
% 0.20/0.45
% 0.20/0.45 % (25032)Memory used [KB]: 1736
% 0.20/0.45 % (25032)Time elapsed: 0.069 s
% 0.20/0.45 % (25032)Instructions burned: 109 (million)
% 0.20/0.45 % (25032)------------------------------
% 0.20/0.45 % (25032)------------------------------
% 0.20/0.45 % (25025)Success in time 0.096 s
%------------------------------------------------------------------------------