TSTP Solution File: LAT391-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LAT391-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n021.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 : Mon May 20 23:44:31 EDT 2024
% Result : Unsatisfiable 2.06s 0.66s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 15 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 75 ( 75 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4580,plain,
$false,
inference(trivial_inequality_removal,[],[f4527]) ).
fof(f4527,plain,
b != b,
inference(superposition,[],[f2,f2119]) ).
fof(f2119,plain,
! [X2,X0,X1] : mult(mult(plus(X0,X1),plus(X1,X2)),X1) = X1,
inference(superposition,[],[f2002,f245]) ).
fof(f245,plain,
! [X2,X3,X0,X1,X6,X4,X5] : mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)))) = X1,
inference(forward_demodulation,[],[f244,f63]) ).
fof(f63,plain,
! [X2,X1] : mult(plus(X1,X2),plus(X1,mult(X1,X2))) = X1,
inference(superposition,[],[f38,f38]) ).
fof(f38,plain,
! [X0,X1,X8] : mult(plus(mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X1),plus(X1,mult(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X1))),X8),plus(X1,mult(mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X1),plus(X1,mult(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X1))),X8))) = X1,
inference(superposition,[],[f14,f1]) ).
fof(f1,axiom,
! [X2,X3,X0,X1,X6,X7,X4,X5] : mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X2),plus(mult(plus(X0,mult(mult(plus(X3,X1),plus(X1,X4)),X1)),plus(mult(plus(X1,plus(plus(mult(X3,mult(X1,X4)),mult(X5,X1)),X1)),plus(X6,mult(X1,plus(plus(mult(X1,X7),mult(X5,X1)),X1)))),mult(X0,mult(mult(plus(X3,X1),plus(X1,X4)),X1)))),mult(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(f14,plain,
! [X2,X3,X0,X1,X8,X6,X9,X7,X4,X5] : mult(plus(mult(plus(X7,X1),plus(X1,mult(X7,X1))),X8),plus(mult(plus(X7,mult(mult(plus(X1,X1),plus(X1,X9)),X1)),plus(mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)))),mult(X7,mult(mult(plus(X1,X1),plus(X1,X9)),X1)))),mult(mult(plus(X7,X1),plus(X1,mult(X7,X1))),X8))) = X1,
inference(superposition,[],[f6,f1]) ).
fof(f6,plain,
! [X2,X10,X0,X1,X9] : mult(plus(X0,X1),plus(X1,mult(X0,X1))) = mult(plus(mult(plus(X9,mult(plus(X0,X1),plus(X1,mult(X0,X1)))),plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(X9,mult(plus(X0,X1),plus(X1,mult(X0,X1)))))),X10),plus(mult(plus(X9,mult(mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(plus(X0,X1),plus(X1,mult(X0,X1)))),plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X2)),mult(plus(X0,X1),plus(X1,mult(X0,X1))))),plus(X1,mult(X9,mult(mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(plus(X0,X1),plus(X1,mult(X0,X1)))),plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),X2)),mult(plus(X0,X1),plus(X1,mult(X0,X1))))))),mult(mult(plus(X9,mult(plus(X0,X1),plus(X1,mult(X0,X1)))),plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(X9,mult(plus(X0,X1),plus(X1,mult(X0,X1)))))),X10))),
inference(superposition,[],[f1,f1]) ).
fof(f244,plain,
! [X2,X3,X0,X1,X8,X6,X4,X5] : mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)))) = mult(plus(X1,X8),plus(X1,mult(X1,X8))),
inference(forward_demodulation,[],[f199,f1]) ).
fof(f199,plain,
! [X2,X3,X0,X1,X8,X6,X4,X5] : mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)))) = mult(plus(mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1))))),plus(mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)))),mult(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1))))))),X8),plus(X1,mult(mult(plus(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1))))),plus(mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)))),mult(mult(plus(X0,X1),plus(X1,mult(X0,X1))),mult(plus(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1)),plus(mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))),mult(X0,mult(mult(plus(X2,X1),plus(X1,X3)),X1))))))),X8))),
inference(superposition,[],[f65,f1]) ).
fof(f65,plain,
! [X2,X3,X1,X4] : mult(plus(mult(plus(X2,X1),plus(X1,mult(X2,X1))),X3),plus(mult(plus(X2,mult(mult(plus(X1,X1),plus(X1,X4)),X1)),plus(X1,mult(X2,mult(mult(plus(X1,X1),plus(X1,X4)),X1)))),mult(mult(plus(X2,X1),plus(X1,mult(X2,X1))),X3))) = X1,
inference(superposition,[],[f6,f38]) ).
fof(f2002,plain,
! [X3,X0] : mult(plus(X0,X0),plus(X3,mult(X0,X0))) = X0,
inference(superposition,[],[f1217,f1063]) ).
fof(f1063,plain,
! [X2,X0,X1] : plus(plus(mult(X0,mult(X0,X1)),mult(X2,X0)),X0) = X0,
inference(superposition,[],[f937,f812]) ).
fof(f812,plain,
! [X2,X3,X1,X6,X4,X5] : mult(plus(X1,plus(plus(mult(X2,mult(X1,X3)),mult(X4,X1)),X1)),plus(X5,mult(X1,plus(plus(mult(X1,X6),mult(X4,X1)),X1)))) = X1,
inference(superposition,[],[f245,f38]) ).
fof(f937,plain,
! [X0,X1] : mult(plus(X0,X1),plus(X1,mult(X0,X1))) = X1,
inference(superposition,[],[f812,f1]) ).
fof(f1217,plain,
! [X2,X3,X0,X4] : mult(plus(X0,X0),plus(X3,mult(X0,plus(plus(mult(X0,X4),mult(X2,X0)),X0)))) = X0,
inference(superposition,[],[f812,f1063]) ).
fof(f2,axiom,
b != mult(mult(plus(a,b),plus(b,c)),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT391-1 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 19:38:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (30563)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (30569)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.15/0.38 % (30564)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (30568)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.15/0.38 % (30570)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.15/0.38 % (30566)WARNING: value z3 for option sas not known
% 0.15/0.39 % (30565)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39 % (30567)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39 % (30566)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.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.40 TRYING [1]
% 0.15/0.40 TRYING [2]
% 0.15/0.40 TRYING [3]
% 0.21/0.42 TRYING [3]
% 2.06/0.65 % (30570)First to succeed.
% 2.06/0.65 % (30570)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30563"
% 2.06/0.66 % (30570)Refutation found. Thanks to Tanya!
% 2.06/0.66 % SZS status Unsatisfiable for theBenchmark
% 2.06/0.66 % SZS output start Proof for theBenchmark
% See solution above
% 2.06/0.66 % (30570)------------------------------
% 2.06/0.66 % (30570)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/0.66 % (30570)Termination reason: Refutation
% 2.06/0.66
% 2.06/0.66 % (30570)Memory used [KB]: 5110
% 2.06/0.66 % (30570)Time elapsed: 0.271 s
% 2.06/0.66 % (30570)Instructions burned: 585 (million)
% 2.06/0.66 % (30563)Success in time 0.28 s
%------------------------------------------------------------------------------